| 000 | 07130cam a2200805 i 4500 | ||
|---|---|---|---|
| 001 | ocn841039606 | ||
| 003 | OCoLC | ||
| 005 | 20240523125535.0 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 130416s2013 nju ob 001 0 eng | ||
| 010 | _a 2013015614 | ||
| 040 |
_aDLC _beng _erda _epn _cDLC _dYDX _dN$T _dCUS _dYDXCP _dVLB _dE7B _dRECBK _dOCLCF _dEBLCP _dDEBSZ _dCOO _dOCLCQ _dOCLCO _dLOA _dDG1 _dMOR _dCCO _dLIP _dPIFPO _dMERUC _dOCLCQ _dZCU _dU3W _dMERER _dCOCUF _dCUY _dOCLCQ _dUUM _dSTF _dWRM _dNRAMU _dICG _dINT _dVT2 _dAU@ _dOCLCQ _dWYU _dOCLCQ _dDKC _dOCLCQ _dUKAHL _dOCLCQ _dUKCRE _dOCLCQ _dOCLCO _dOCLCQ _dOCLCO _dOCLCL |
||
| 019 |
_a852757497 _a961541194 _a962679727 _a966264016 _a988432645 _a991945774 _a1037730165 _a1038629529 _a1045484584 _a1058227450 _a1100441919 _a1124314861 _a1153531373 |
||
| 020 |
_a9781118537039 _q(pdf) |
||
| 020 |
_a1118537033 _q(pdf) |
||
| 020 |
_a9781118536964 _q(epub) |
||
| 020 |
_a1118536967 _q(epub) |
||
| 020 |
_a9781118536995 _q(mobi) |
||
| 020 |
_a1118536991 _q(mobi) |
||
| 020 | _a9781118537015 | ||
| 020 | _a1118537017 | ||
| 020 |
_z9780470905364 _q(cloth) |
||
| 029 | 1 |
_aAU@ _b000050856223 |
|
| 029 | 1 |
_aAU@ _b000052913900 |
|
| 029 | 1 |
_aCHBIS _b010026995 |
|
| 029 | 1 |
_aCHNEW _b000941672 |
|
| 029 | 1 |
_aCHVBK _b480219494 |
|
| 029 | 1 |
_aDEBBG _bBV043395753 |
|
| 029 | 1 |
_aDEBBG _bBV044050323 |
|
| 029 | 1 |
_aDEBSZ _b431445087 |
|
| 029 | 1 |
_aNZ1 _b15341647 |
|
| 035 |
_a(OCoLC)841039606 _z(OCoLC)852757497 _z(OCoLC)961541194 _z(OCoLC)962679727 _z(OCoLC)966264016 _z(OCoLC)988432645 _z(OCoLC)991945774 _z(OCoLC)1037730165 _z(OCoLC)1038629529 _z(OCoLC)1045484584 _z(OCoLC)1058227450 _z(OCoLC)1100441919 _z(OCoLC)1124314861 _z(OCoLC)1153531373 |
||
| 042 | _apcc | ||
| 050 | 0 | 0 | _aT57.6 |
| 072 | 7 |
_aBUS _x093000 _2bisacsh |
|
| 082 | 0 | 0 |
_a658.2/101156 _223 |
| 049 | _aMAIN | ||
| 100 | 1 |
_aDaskin, Mark S., _d1952- |
|
| 245 | 1 | 0 |
_aNetwork and discrete location : _bmodels, algorithms, and applications / _cMark S. Daskin, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI. |
| 250 | _aSecond edition. | ||
| 264 | 1 |
_aHoboken, New Jersey : _bJohn Wiley & Sons, Inc., _c[2013] |
|
| 300 | _a1 online resource | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 588 | 0 | _aPrint version record and CIP data provided by publisher. | |
| 505 | 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. | |
| 505 | 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. | |
| 505 | 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. | |
| 505 | 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. | |
| 505 | 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. | |
| 520 | _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. | ||
| 590 |
_aJohn Wiley and Sons _bWiley Online Library: Complete oBooks |
||
| 650 | 0 |
_aIndustrial location _xMathematical models. |
|
| 650 | 7 |
_aBUSINESS & ECONOMICS _xFacility Management. _2bisacsh |
|
| 650 | 7 |
_aIndustrial location _xMathematical models _2fast |
|
| 758 |
_ihas work: _aNetwork and discrete location (Text) _1https://id.oclc.org/worldcat/entity/E39PCFRccrp6wvQP6xf9XJdfFX _4https://id.oclc.org/worldcat/ontology/hasWork |
||
| 776 | 0 | 8 |
_iPrint version: _aDaskin, Mark S., 1952- _tNetwork and discrete location. _bSecond edition. _dHoboken, New Jersey : John Wiley & Sons, Inc., [2013] _z9780470905364 _w(DLC) 2013002857 _w(OCoLC)841037524 |
| 856 | 4 | 0 | _uhttps://onlinelibrary.wiley.com/doi/book/10.1002/9781118537015 |
| 938 |
_aAskews and Holts Library Services _bASKH _nAH25494978 |
||
| 938 |
_aebrary _bEBRY _nebr10726741 |
||
| 938 |
_aEBSCOhost _bEBSC _n601808 |
||
| 938 |
_aRecorded Books, LLC _bRECE _nrbeEB00063835 |
||
| 938 |
_aYBP Library Services _bYANK _n10841044 |
||
| 938 |
_aYBP Library Services _bYANK _n10858159 |
||
| 938 |
_aYBP Library Services _bYANK _n10004655 |
||
| 994 |
_a92 _bINLUM |
||
| 999 |
_c11919 _d11919 |
||