{"product_id":"network-and-discrete-location-9780470905364","title":"Network and Discrete Location","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e\u003cb\u003ePraise for the\u003c\/b\u003e \u003cb\u003e\u003ci\u003eFirst Edition\u003cbr\u003e \u003c\/i\u003e\u003c\/b\u003e\u003cb\u003eThis book is refreshing to read since it takes an important topic...\u003cbr\u003e \u003c\/b\u003e \u003cb\u003eand presents it in a clear and concise manner by using examples that\u003c\/b\u003e \u003cb\u003einclude visual presentations of the problem, solution methods, and\u003c\/b\u003e \u003cb\u003eresults along with an explanation of the mathematical and procedural\u003c\/b\u003e \u003cb\u003esteps required to model the problem and work through to a solution.\u003c\/b\u003e \u003cb\u003e\u003ci\u003eJournal of Classification\u003c\/i\u003e\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eThoroughly updated and revised, \u003ci\u003eNetwork and Discrete Location: Models, Algorithms, and\u003c\/i\u003e \u003ci\u003eApplications, Second Edition\u003c\/i\u003e remains the go-to guide on facility location modeling. The book offers a unique introduction to methodological tools for solving location models and provides insight into when each approach is useful and what information can be obtained.\u003c\/p\u003e \u003cp\u003eThe \u003ci\u003eSecond Edition\u003c\/i\u003e focuses on real-world extensions of the basic models used in locating facilities, including production and di\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003e\u003c\/p\u003e\u003cp\u003ePreface to the First and Second Editions xi\u003c\/p\u003e \u003cp\u003eAcknowledgments xvii\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1. Introduction to Location Theory and Models 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Introduction 1\u003c\/p\u003e \u003cp\u003e1.2 Key Questions Addressed by Location Models 3\u003c\/p\u003e \u003cp\u003e1.3 Example Problem Descriptions 4\u003c\/p\u003e \u003cp\u003e1.3.1 Ambulance Location 4\u003c\/p\u003e \u003cp\u003e1.3.2 Siting Landfills for Hazardous Wastes 10\u003c\/p\u003e \u003cp\u003e1.3.3 Summary 10\u003c\/p\u003e \u003cp\u003e1.4 Key Dimensions of Location Problems and Models 11\u003c\/p\u003e \u003cp\u003e1.4.1 Planar Versus Network Versus Discrete Location Models 11\u003c\/p\u003e \u003cp\u003e1.4.2 Tree Problems Versus General Graph Problems 12\u003c\/p\u003e \u003cp\u003e1.4.3 Distance Metrics 13\u003c\/p\u003e \u003cp\u003e1.4.4 Number of Facilities to Locate 14\u003c\/p\u003e \u003cp\u003e1.4.5 Static Versus Dynamic Location Problems 15\u003c\/p\u003e \u003cp\u003e1.4.6 Deterministic Versus Probabilistic Models 16\u003c\/p\u003e \u003cp\u003e1.4.7 Single- Versus Multiple-Product Models 16\u003c\/p\u003e \u003cp\u003e1.4.8 Private Versus Public Sector Problems 17\u003c\/p\u003e \u003cp\u003e1.4.9 Single- Versus Multiple-Objective Problems and Models 17\u003c\/p\u003e \u003cp\u003e1.4.10 Elastic Versus Inelastic Demand 18\u003c\/p\u003e \u003cp\u003e1.4.11 Capacitated Versus Uncapacitated Facilities 18\u003c\/p\u003e \u003cp\u003e1.4.12 Nearest Facility Versus General Demand Allocation Models 18\u003c\/p\u003e \u003cp\u003e1.4.13 Hierarchical Versus Single-Level Models 19\u003c\/p\u003e \u003cp\u003e1.4.14 Desirable Versus Undesirable Facilities 19\u003c\/p\u003e \u003cp\u003e1.5 A Taxonomy of Location Models 20\u003c\/p\u003e \u003cp\u003e1.5.1 Typology of Location Models 20\u003c\/p\u003e \u003cp\u003e1.5.2 A Simple Analytic Model 22\u003c\/p\u003e \u003cp\u003e1.6 Summary 26\u003c\/p\u003e \u003cp\u003eExercises 27\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2. Review of Linear Programming 29\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Introduction 29\u003c\/p\u003e \u003cp\u003e2.2 The Canonical Form of a Linear Programming Problem 31\u003c\/p\u003e \u003cp\u003e2.3 Constructing the Dual of an LP Problem 34\u003c\/p\u003e \u003cp\u003e2.4 Complementary Slackness and the Relationships Between the Primal and the Dual Linear Programming Problems 36\u003c\/p\u003e \u003cp\u003e2.5 Solving a Linear Programming Problem in Excel 43\u003c\/p\u003e \u003cp\u003e2.6 The Transportation Problem 47\u003c\/p\u003e \u003cp\u003e2.7 The Shortest Path Problem 64\u003c\/p\u003e \u003cp\u003e2.7.1 The Shortest Path Problem in Excel 78\u003c\/p\u003e \u003cp\u003e2.7.2 The Shortest Path Problem in AMPL 80\u003c\/p\u003e \u003cp\u003e2.8 The Out-of-Kilter Flow Algorithm 80\u003c\/p\u003e \u003cp\u003e2.9 Integer Programming Problems 92\u003c\/p\u003e \u003cp\u003e2.10 Summary 96\u003c\/p\u003e \u003cp\u003eExercises 97\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3. An Overview of Complexity Analysis 111\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Introduction 111\u003c\/p\u003e \u003cp\u003e3.2 Basic Concepts and Notation 112\u003c\/p\u003e \u003cp\u003e3.3 Example Computation of an Algorithm’s Complexity 115\u003c\/p\u003e \u003cp\u003e3.4 The Classes P and NP (and NP-Hard and NP-Complete) 117\u003c\/p\u003e \u003cp\u003e3.5 Summary 122\u003c\/p\u003e \u003cp\u003eExercises 123\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4. Covering Problems 124\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Introduction and the Notion of Coverage 124\u003c\/p\u003e \u003cp\u003e4.2 The Set Covering Model 125\u003c\/p\u003e \u003cp\u003e4.3 Applications of the Set Covering Model 137\u003c\/p\u003e \u003cp\u003e4.4 Variants of the Set Covering Location Model 140\u003c\/p\u003e \u003cp\u003e4.5 The Maximum Covering Location Model 143\u003c\/p\u003e \u003cp\u003e4.5.1 The Greedy Adding Algorithm: A Heuristic Algorithm for Solving the Maximum Covering Location Model 146\u003c\/p\u003e \u003cp\u003e4.5.2 Lagrangian Relaxation: An Optimization-Based Heuristic Algorithm for Solving the Maximum Covering Location Model 154\u003c\/p\u003e \u003cp\u003e4.5.3 Other Solution Approaches and Example Results 163\u003c\/p\u003e \u003cp\u003e4.6 An Interesting Model Property or It Ain’t Necessarily So 164\u003c\/p\u003e \u003cp\u003e4.7 The Maximum Expected Covering Location Model 168\u003c\/p\u003e \u003cp\u003e4.8 Summary 174\u003c\/p\u003e \u003cp\u003eExercises 175\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5. Center Problems 193\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Introduction 193\u003c\/p\u003e \u003cp\u003e5.2 Vertex \u003ci\u003eP\u003c\/i\u003e-Center Formulation 198\u003c\/p\u003e \u003cp\u003e5.3 The Absolute 1- and 2-Center Problems on a Tree 201\u003c\/p\u003e \u003cp\u003e5.3.1 Absolute 1-Center on an Unweighted Tree 201\u003c\/p\u003e \u003cp\u003e5.3.2 Absolute 2-Centers on an Unweighted Tree 205\u003c\/p\u003e \u003cp\u003e5.3.3 Absolute 1-Center on a Weighted Tree 206\u003c\/p\u003e \u003cp\u003e5.4 The Unweighted Vertex \u003ci\u003eP\u003c\/i\u003e-Center Problem on a General Graph 211\u003c\/p\u003e \u003cp\u003e5.5 The Unweighted Absolute \u003ci\u003eP\u003c\/i\u003e-Center Problem on a General Graph 215\u003c\/p\u003e \u003cp\u003e5.5.1 Characteristics of the Solution to the Absolute \u003ci\u003eP\u003c\/i\u003e-Center Problem 215\u003c\/p\u003e \u003cp\u003e5.5.2 An Algorithm for the Unweighted Absolute\u003ci\u003e P\u003c\/i\u003e-Center on a General Graph 219\u003c\/p\u003e \u003cp\u003e5.6 Summary 229\u003c\/p\u003e \u003cp\u003eExercises 230\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6. Median Problems 235\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Introduction 235\u003c\/p\u003e \u003cp\u003e6.2 Formulation and Properties 237\u003c\/p\u003e \u003cp\u003e6.3 1-Median Problem on a Tree 241\u003c\/p\u003e \u003cp\u003e6.4 Heuristic Algorithms for the \u003ci\u003eP\u003c\/i\u003e-Median Problem 246\u003c\/p\u003e \u003cp\u003e6.5 An Optimization-Based Lagrangian Algorithm for the \u003ci\u003eP\u003c\/i\u003e-Median Problem 260\u003c\/p\u003e \u003cp\u003e6.5.1 Methodological Development 260\u003c\/p\u003e \u003cp\u003e6.5.2 Numerical Example 265\u003c\/p\u003e \u003cp\u003e6.5.3 Extensions and Enhancements to the Lagrangian Procedures 271\u003c\/p\u003e \u003cp\u003e6.6 Computational Results Using the Heuristic Algorithms and the Lagrangian Relaxation Algorithm 271\u003c\/p\u003e \u003cp\u003e6.7 Another Interesting Property or It Still Ain’t Necessarily So 277\u003c\/p\u003e \u003cp\u003e6.8 Summary 283\u003c\/p\u003e \u003cp\u003eExercises 285\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7. Fixed Charge Facility Location Problems 294\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Introduction 294\u003c\/p\u003e \u003cp\u003e7.2 Uncapacitated Fixed Charge Facility Location Problems 297\u003c\/p\u003e \u003cp\u003e7.2.1 Heuristic Construction Algorithms 298\u003c\/p\u003e \u003cp\u003e7.2.2 Heuristic Improvement Algorithms 305\u003c\/p\u003e \u003cp\u003e7.2.3 A Lagrangian Relaxation Approach 311\u003c\/p\u003e \u003cp\u003e7.2.4 A Dual-Based Approach 314\u003c\/p\u003e \u003cp\u003e7.3 Capacitated Fixed Charge Facility Location Problems 325\u003c\/p\u003e \u003cp\u003e7.3.1 Lagrangian Relaxation Approaches 328\u003c\/p\u003e \u003cp\u003e7.3.2 Bender’s Decomposition 345\u003c\/p\u003e \u003cp\u003e7.4 Summary 355\u003c\/p\u003e \u003cp\u003eExercises 356\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8. Extensions of Location Models 362\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Introduction 362\u003c\/p\u003e \u003cp\u003e8.2 Multiobjective Problems 362\u003c\/p\u003e \u003cp\u003e8.3 Hierarchical Facility Location Models 375\u003c\/p\u003e \u003cp\u003e8.3.1 Basic Notions of Hierarchical Facilities 375\u003c\/p\u003e \u003cp\u003e8.3.2 Basic Median-Based Hierarchical Location Formulations 379\u003c\/p\u003e \u003cp\u003e8.3.3 Coverage-Based Hierarchical Location Formulations 383\u003c\/p\u003e \u003cp\u003e8.3.4 Extensions of Hierarchical Location Formulations 385\u003c\/p\u003e \u003cp\u003e8.4 Models of Interacting Facilities 387\u003c\/p\u003e \u003cp\u003e8.4.1 Flows Between Facilities 387\u003c\/p\u003e \u003cp\u003e8.4.2 Facilities with Proximity Constraints 390\u003c\/p\u003e \u003cp\u003e8.5 Multiproduct Flows and Production\/Distribution Systems 393\u003c\/p\u003e \u003cp\u003e8.6 Location\/Routing Problems 399\u003c\/p\u003e \u003cp\u003e8.7 Hub Location Problems 410\u003c\/p\u003e \u003cp\u003e8.8 Dispersion Models and Models for the Location of Undesirable Facilities 425\u003c\/p\u003e \u003cp\u003e8.8.1 Dispersion Models 426\u003c\/p\u003e \u003cp\u003e8.8.2 A Maxisum Model for the Location of Undesirable Facilities 429\u003c\/p\u003e \u003cp\u003e8.9 An Integrated Location-Inventory Model 435\u003c\/p\u003e \u003cp\u003e8.9.1 A Multiobjective Location-Inventory\/Covering Model 448\u003c\/p\u003e \u003cp\u003e8.9.2 A Look at Aggregation Effects 452\u003c\/p\u003e \u003cp\u003e8.10 Reliability and Facility Location Modeling 455\u003c\/p\u003e \u003cp\u003e8.10.1 The Expected Failure Case 458\u003c\/p\u003e \u003cp\u003e8.10.2 Modeling a Malevolent Attacker 461\u003c\/p\u003e \u003cp\u003e8.11 Summary 466\u003c\/p\u003e \u003cp\u003eExercises 468\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9. Location Modeling in Perspective 480\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Introduction 480\u003c\/p\u003e \u003cp\u003e9.2 The Planning Process for Facility Location 481\u003c\/p\u003e \u003cp\u003e9.2.1 Problem Definition 481\u003c\/p\u003e \u003cp\u003e9.2.2 Analysis 483\u003c\/p\u003e \u003cp\u003e9.2.3 Communication and Decision 489\u003c\/p\u003e \u003cp\u003e9.2.4 Implementation 495\u003c\/p\u003e \u003cp\u003e9.2.5 Caveats on the Planning Process 496\u003c\/p\u003e \u003cp\u003e9.3 Summary 496\u003c\/p\u003e \u003cp\u003eExercises 497\u003c\/p\u003e \u003cp\u003eReferences 499\u003c\/p\u003e \u003cp\u003eIndex 509\u003c\/p\u003e","brand":"John Wiley \u0026 Sons Inc","offers":[{"title":"Default Title","offer_id":49402456342871,"sku":"9780470905364","price":114.26,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9780470905364.jpg?v=1730480455","url":"https:\/\/bookcurl.com\/products\/network-and-discrete-location-9780470905364","provider":"Book Curl","version":"1.0","type":"link"}