Models for public systems analysis /

Models for Public Systems Analysis.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Beltrami, Edward J.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York : Academic Press, 1977.
Colección:Operations research and industrial engineering.
Temas:
Municipal services > Mathematical models.
Services municipaux > Mod�eles math�ematiques.
Municipal services > Mathematical models
Kommunale Dienstleistung
Mathematisches Modell
Systemanalyse
Anwendung
Stadtplanung
Operations Research
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Front Cover; Models for Public Systems Analysis; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; INTRODUCTION: Some Thoughts on Mathematics and Public Policy; REFERENCES; CHAPTER 1. Plant Location and Optimal Distribution; 1.1 A WASTE DISPOSAL PROBLEM; 1.2 OPTIMAL LOCATION OF FACILITIES; 1.3 MORE ON OPTIMAL PLANT SITING; 1.4 SEWAGE TREATMENT IS ALSO A PLANT LOCATION PROBLEM; 1.5 ENERGY MODELS; 1.6 EXERCISES; 1.7 NOTES AND REMARKS; CHAPTER 2. Manpower Scheduling; 2.1 A NONLINEAR ALLOCATION MODEL; 2.2 WHO IS TO PICK UP ALL THE GARBAGE?
  • 2.3 A MODEL FOR MANPOWER SCHEDULING2.4 EXERCISES; 2.5 NOTES AND REMARKS; CHAPTER 3. Models for Deploying Emergency Services I: Response Delays; 3.1 MODELS OF CONGESTION; 3.2 COST VERSUS SERVICE; 3.3 A SPATIAL ""HYPERCUBE"" MODEL; 3.4 PRIORITIES; 3.5 EXERCISES; 3.6 NOTES AND REMARKS; CHAPTER 4. Models for Deploying Emergency Services II: Allocation of Units; 4.1 DEPLOYMENT OF FIREFIGHTERS; 4.2 SOME GEOMETRIC MODELS; 4.3 THE INVERSE SQUARE ROOT LAW; 4.4 RANDOM PATROLS; 4.5 EXERCISES; 4.6 NOTES AND REMARKS; CHAPTER 5. Network Optimization; 5.1 WHERE DO WE PUT THE FIRE STATION?
  • 5.2 HEURISTIC TECHNIQUES FOR VEHICLE ROUTING5.3 SOME QUESTIONS OF SCHEDULING; 5.4 CLEANER STREETS; 5.5 EXERCISES; 5.6 NOTES AND REMARKS; POSTSCRIPT: Urban Growth Models; REFERENCES; APPENDIX A: Linear Programming; LINEAR PROGRAMS; FEASIBLE SETS AND OPTIMIZATION; THE SIMPLEX METHOD; ARTIFICIAL VARIABLES; DUALITY; TRANSPORTATION PROBLEMS; NOTES; APPENDIX B: Integer Programming; SET COVERING; UNIMODULARITY; NOTES; APPENDIX C: Random Processes; POISSON ARRIVALS; QUEUEING; SOME SPECIAL CASES; NOTES AND REMARKS; APPENDIX D: Nonlinear Optimization; THE PENALTY ARGUMENT; AN IMPORTANT SPECIAL CASE
  • DUALITYNOTES; APPENDIX E: Graphs, Minimal Trees, and Shortest Paths; Index

Ejemplares similares