06222cam a2200733 i 4500001001300000003000600013005001700019006001900036007001500055008004100070010001700111020002500128020002200153020002600175020002300201020002600224020002300250020001800273020001500291020002700306029002200333029002200355029002100377029002100398029002100419029003600440029001800476029002300494035009300517040011100610042000800721049000900729050001000738072002500748082002100773100002800794245020800822250002001030264006001050300002301110336002601133337002601159338003601185504005101221505060101272505060301873505058202476505056103058505057403619520060004193588006104793650004604854650002304900650004604923650002604969650005604995650007205051655002205123655002905145776019905174856008405373942001205457999001905469ocn841039606OCoLC20171107083135.0m     o  d        cr |||||||||||130416s2013    nju     ob    001 0 eng    a  2013015614  a9781118537039q(pdf)  a1118537033q(pdf)  a9781118536964q(epub)  a1118536967q(epub)  a9781118536995q(mobi)  a1118536991q(mobi)  a9781118537015  a1118537017  z9780470905364q(cloth)1 aAU@b0000508562231 aAU@b0000529139001 aCHBISb0100269951 aCHVBKb30624103X1 aDEBSZb4314450871 aDKDLAb820120-katalog:0006646251 aNZ1b153416471 aDEBBGbBV043395753  a(OCoLC)841039606z(OCoLC)852757497z(OCoLC)961541194z(OCoLC)962679727z(OCoLC)966264016  aDLCbengerdaepncDLCdYDXdN$TdCUSdYDXCPdVLBdE7BdRECBKdOCLCFdEBLCPdDEBSZdCOOdOCLCQdOCLCOdLOA  apcc  aMAIN00aT57.6 7aBUSx0930002bisacsh00a658.2/1011562231 aDaskin, Mark S.,d1952-10aNetwork and discrete location : models, algorithms, and applications /cMark S. Daskin, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.h[electronic resource]   aSecond edition. 1aHoboken, New Jersey :bJohn Wiley & Sons, Inc.,c[2013]  a1 online resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  aIncludes bibliographical references and index.0 aNetwork and Discrete Location: Models, Algorithms, and Applications; Contents; Preface to the First and Second Editions; Acknowledgments; 1. Introduction to Location Theory and Models; 1.1 Introduction; 1.2 Key Questions Addressed by Location Models; 1.3 Example Problem Descriptions; 1.3.1 Ambulance Location; 1.3.2 Siting Landfills for Hazardous Wastes; 1.3.3 Summary; 1.4 Key Dimensions of Location Problems and Models; 1.4.1 Planar Versus Network Versus Discrete Location Models; 1.4.2 Tree Problems Versus General Graph Problems; 1.4.3 Distance Metrics; 1.4.4 Number of Facilities to Locate.8 a1.4.5 Static Versus Dynamic Location Problems1.4.6 Deterministic Versus Probabilistic Models; 1.4.7 Single- Versus Multiple-Product Models; 1.4.8 Private Versus Public Sector Problems; 1.4.9 Single- Versus Multiple-Objective Problems and Models; 1.4.10 Elastic Versus Inelastic Demand; 1.4.11 Capacitated Versus Uncapacitated Facilities; 1.4.12 Nearest Facility Versus General Demand Allocation Models; 1.4.13 Hierarchical Versus Single-Level Models; 1.4.14 Desirable Versus Undesirable Facilities; 1.5 ATaxonomy of Location Models; 1.5.1 Typology of Location Models; 1.5.2 A Simple Analytic Model.8 a1.6 SummaryExercises; 2. Review of Linear Programming; 2.1 Introduction; 2.2 The Canonical Form of a Linear Programming Problem; 2.3 Constructing the Dual of an LP Problem; 2.4 Complementary Slackness and the Relationships Between the Primal and the Dual Linear Programming Problems; 2.5 Solving a Linear Programming Problem in Excel; 2.6 The Transportation Problem; 2.7 The Shortest Path Problem; 2.7.1 The Shortest Path Problem in Excel; 2.7.2 The Shortest Path Problem in AMPL; 2.8 The Out-of-Kilter Flow Algorithm; 2.9 Integer Programming Problems; 2.10 Summary; Exercises.8 a3. An Overview of Complexity Analysis3.1 Introduction; 3.2 Basic Concepts and Notation; 3.3 Example Computation of an Algorithm's Complexity; 3.4 The Classes P and NP (and NP-Hard and NP-Complete); 3.5 Summary; Exercises; 4. Covering Problems; 4.1 Introduction and the Notion of Coverage; 4.2 The Set Covering Model; 4.3 Applications of the Set Covering Model; 4.4 Variants of the Set Covering Location Model; 4.5 The Maximum Covering Location Model; 4.5.1 The Greedy Adding Algorithm: A Heuristic Algorithm for Solving the Maximum Covering Location Model.8 a4.5.2 Lagrangian Relaxation: An Optimization-Based Heuristic Algorithm for Solving the Maximum Covering Location Model4.5.3 Other Solution Approaches and Example Results; 4.6 An Interesting Model Property or It Ain't Necessarily So; 4.7 The Maximum Expected Covering Location Model; 4.8 Summary; Exercises; 5. Center Problems; 5.1 Introduction; 5.2 Vertex P-Center Formulation; 5.3 The Absolute 1- and 2-Center Problems on a Tree; 5.3.1 Absolute 1-Center on an Unweighted Tree; 5.3.2 Absolute 2-Centers on an Unweighted Tree; 5.3.3 Absolute 1-Center on a Weighted Tree.  aThis Second Edition remains the only hands-on guide to using and developing facility location models. It offers a practice-oriented introduction to model-building methods and solution algorithms complete with software for solving classical problems of realistic size and end-of-chapter exercises to enhance reader understanding. The book introduces readers to the key classical location problems (covering, center, median, and fixed charge); discusses real-world extensions of the basic models used in locating; outlines a host of methodological tools for solving location models; and much more.0 aPrint version record and CIP data provided by publisher. 0aIndustrial locationxMathematical models. 4aDiscrete location. 4aIndustrial locationxMathematical models. 4aProbabilistic models. 7aBUSINESS & ECONOMICSxFacility Management.2bisacsh 7aIndustrial locationxMathematical models.2fast0(OCoLC)fst00971237 4aElectronic books. 7aElectronic books.2local08iPrint version:aDaskin, Mark S., 1952-tNetwork and discrete location.bSecond edition.dHoboken, New Jersey : John Wiley & Sons, Inc., [2013]z9780470905364w(DLC)  2013002857w(OCoLC)84103752440uhttp://onlinelibrary.wiley.com/book/10.1002/9781118537015zWiley Online Library  2ddccBK  c206656d206656