The logic of logistics: theory, algorithms, and applications for logistics management
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
New York ; Heidelberg ; Dordrecht ; London
Springer
[2014]
|
| Ausgabe: | Third edition |
| Schriftenreihe: | Springer series in operations research and financial engineering
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027275512&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Beschreibung: | Literaturverzeichnis Seite 421-439 |
| Umfang: | xx, 447 Seiten Diagramme |
| ISBN: | 9781461491484 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041830619 | ||
| 003 | DE-604 | ||
| 005 | 20220726 | ||
| 007 | t| | ||
| 008 | 140506s2014 xx |||| |||| 00||| eng d | ||
| 020 | |a 9781461491484 |c print |9 978-1-4614-9148-4 | ||
| 035 | |a (OCoLC)860394924 | ||
| 035 | |a (DE-599)BVBBV041830619 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-862 |a DE-573 |a DE-83 |a DE-20 |a DE-473 | ||
| 050 | 0 | |a QA402-402.37 | |
| 050 | 0 | |a T57.6-57.97 | |
| 082 | 0 | |a 519.6 | |
| 084 | |a QH 463 |0 (DE-625)141599: |2 rvk | ||
| 084 | |a QP 530 |0 (DE-625)141897: |2 rvk | ||
| 084 | |a 90B80 |2 msc | ||
| 084 | |a 90-01 |2 msc | ||
| 084 | |a WIR 780f |2 stub | ||
| 084 | |a 90B06 |2 msc | ||
| 100 | 1 | |a Simchi-Levi, David |e Verfasser |0 (DE-588)170583783 |4 aut | |
| 245 | 1 | 0 | |a The logic of logistics |b theory, algorithms, and applications for logistics management |c David Simchi-Levi ; Xin Chen ; Julien Bramel |
| 250 | |a Third edition | ||
| 264 | 1 | |a New York ; Heidelberg ; Dordrecht ; London |b Springer |c [2014] | |
| 300 | |a xx, 447 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Springer series in operations research and financial engineering | |
| 500 | |a Literaturverzeichnis Seite 421-439 | ||
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Industrial engineering | |
| 650 | 4 | |a Economics, Mathematical | |
| 650 | 4 | |a Mathematics | |
| 650 | 0 | 7 | |a Unternehmen |0 (DE-588)4061963-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logistikplanung |0 (DE-588)4246866-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logistik |0 (DE-588)4036210-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Operations Research |0 (DE-588)4043586-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Logistik |0 (DE-588)4036210-3 |D s |
| 689 | 0 | 1 | |a Unternehmen |0 (DE-588)4061963-1 |D s |
| 689 | 0 | 2 | |a Operations Research |0 (DE-588)4043586-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Unternehmen |0 (DE-588)4061963-1 |D s |
| 689 | 1 | 1 | |a Logistikplanung |0 (DE-588)4246866-8 |D s |
| 689 | 1 | 2 | |a Operations Research |0 (DE-588)4043586-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Chen, Xin |d 1967- |e Verfasser |0 (DE-588)128608986 |4 aut | |
| 700 | 1 | |a Bramel, Julien |e Verfasser |0 (DE-588)173112668 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4614-9149-1 |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027275512&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027275512 | |
Datensatz im Suchindex
| _version_ | 1819331217031430144 |
|---|---|
| adam_text | Contents 1 Introduction 1.1 What Is Logistics Management? ....................................................... 1.2 Managing Cost and Uncertainty ....................................................... 1.3 Examples............................................................................................... 1.4 Modeling Logistics Problems ............................................................. 1.5 Logistics and Supply Chain in Practice.............................................. 1.6 Evaluation of Solution Techniques .................................................... 1.7 Additional Topics.................................................................................. 1.8 Book Overview...................................................................................... Part I Performance Analysis Techniques 2 Convexity and Supermodularity 2.1 Convex Analysis.................................................................................. 2.1.1 Convex Sets and Convex Functions........................................ 2.1.2 Continuity and Differentiability Properties............................ 2.1.3 Characterization of Convex Functions.................................. 2.1.4 Convexity and Optimization ................................................. 2.2 Supermodularity.................................................................................. 2.3 Discrete Convex Analysis................................................................... 2.3.1 L^-Convexity............................................................................. 2.3.2
A^-Convexity............................................................................. 2.4 Exercises ............................................................................................... 1 1 3 4 7 8 9 10 11 13 15 15 15 18 23 25 27 35 36 39 42 xi
xii Contents 3 Game Theory Noncooperative Game Theory...................... · · .................................. 3.1.1 Definition and Existence of Nash Equilibrium...................... 3.1.2 Uniqueness of Nash Equilibrium ............................................ 3.2 Cooperative Game Theory..................................................................... 3.2.1 Core .............................................................................................. 3.2.2 Nucleolus..................................................................................... 3.2.3 Shapley Value............................................................................... 3.3 Exercises ................................................................................................. 3.1 4 Worst-Case Analysis 4.1 4.2 Introduction.............................................................................................. The Bin-Packing Problem..................................................................... 4.2.1 First-Fit and Best-Fit............................................................... 4.2.2 First-Fit Decreasing and Best-Fit Decreasing...................... 4.3 The Traveling Salesman Problem......................................................... 4.3.1 A Minimum Spanning Tree-Based Heuristic.......................... 4.3.2 The Nearest-Insertion Heuristic................................................ 4.3.3 Christofides’ Heuristic............................................... 4.3.4 Local Search Heuristics............................ 4.4 Exercises
................................................................................................ 5 Average-Case Analysis 5.1 Introduction............................................................................................. 5.2 The Bin-Packing Problem..................................................................... 5.3 The Traveling Salesman Problem........................................................ 5.4 Exercises .......................................................... 6 Mathematical Programming-Based Bounds 6.1 Introduction................................ 73 75 78 80 81 85 85 86 91 96 99 99 6.2 An Asymptotically Tight Linear Program . ........................................... 100 6.3 Lagrangian Relaxation............................................................................... 103 6.4 Lagrangian Relaxation and the Traveling Salesman Problem .... 105 6.4.1 The 1-Tree Lower Bound .............................................................. 106 6.4.2 The 1-Tree Lower Bound and Lagrangian Relaxation .... 107 6.5 The Worst-Case Effectiveness of the 1-Tree Lower Bound............ 108 6.6 Exercises ............................................. 112 Part II Inventory Models 7 Economic Lot Size Models with Constant Demands 7.1 Introduction..................................... 7.1.1 The Economic Lot Size Model 115 117 117 117
Contents 7.1.2 The Finite-Horizon Model....................................................... 7.1.3 Power-of-Two Policies............................................................. 7.2 Multi-Item Inventory Models............................................................... 7.2.1 Introduction ............................................................................. 7.2.2 Notation and Assumptions .................................................... 7.2.3 Worst-Case Analyses................................................................. 7.3 A Single-Warehouse Multiretailer Model............................................ 7.3.1 Introduction ............................................................................. 7.3.2 Model and Analysis................................................................. 7.4 Exercises ................................................................................................ xiii 119 121 122 122 124 125 129 129 130 134 8 Economic Lot Size Models with Varying Demands 137 8.1 The Wagner-Whitin Model................................................................ 137 8.2 Models with Capacity Constraints.................................................... 143 8.3 Multi-Item Inventory Models............................................................. 146 8.4 Single-Item Models with Pricing ....................................................... 148 8.5 Exercises ............................................................................................... 150 9 Stochastic Inventory Models 151 9.1
Introduction............................................................................................ 151 9.2 Single-Period Models............................................................................ 152 9.2.1 The Model ................................................................................ 152 9.3 Finite-Horizon Models......................................................................... 153 9.3.1 Model Description.................................................................... 153 9.3.2 К-Convex Functions................................................................. 155 9.3.3 Main Results............................................................................. 158 9.4 Quasiconvex Loss Functions................................................................ 159 9.5 Infinite-Horizon Models ...................................................................... 163 9.6 Models with Positive Lead Times....................................................... 169 9.7 Multi-Echelon Systems......................................................................... 172 9.8 Exercises ............................................................................................... 174 10 Integration of Inventory and Pricing 177 10.1 Introduction............................................................................................ 177 10.2 Demand Models .................................................................................. 178 10.3 Single-Period Stochastic Models.......................................................... 179 10.4 Finite-
Horizon Models......................................................................... 183 10.4.1 Model Description................................................................... 183 10.4.2 Symmetric Jf-Convex Functions .......................................... 185 10.4.3 Additive Demand Functions.................................................... 190 10.4.4 General Demand Functions.................................................... 193 10.4.5 Special Case: Zero Fixed Ordering Cost............................... 194 10.5 Alternative Approach to the Optimality of (s, S, p) Policies .... 194 10.6 Extensions and Challenges.......................................................................2θθ
xiv Contents 10.7 Risk-Averse Inventory Models.............................................................. 201 10.7.1 Expected Utility Risk-Averse Models..........................................203 10.7.2 Exponential Utility Risk-Averse Models................................... 205 10.8 Exercises ................................................................................................ Part III Competition, Coordination and Design Models 211 11 Supply Chain Competition and Collaboration Models 213 11.1 Inventory and Pricing Competition . . ...................................................... 213 11.2 Inventory Centralization Games............................................................ 11.2.1 Model........................................................................................... 217 11.2.2 Inventory Games witha Linear Ordering Cost ......................... 219 11.2.3 Inventory Games withQuantity Discounts.................................. 222 11.3 Exercises .....................................................................................................223 229 Introduction.............................................................................................. 229 Wholesale Price Contracts......................................................................... 231 Buy-Back Contracts.................................................................................. 233 Revenue-Sharing Contracts...................................................................... 234 Portfolio Contracts........................................ 235 Exercises
..................................................................................................... 239 12 Procurement Contracts 12.1 12.2 12.3 12.4 12.5 12.6 13 Process Flexibility 241 13.1 Introduction.................................................................................................. 241 13.2 Supermodularity and Incremental Benefitsof Long Chains.............. 244 13.2.1 Supermodularity in Arc Capacities............................................. 245 13.2.2 Incremental Benefits in Long Chains.......................................... 249 13.3 Characterizing the Performance of Long Chains.................................... 250 13.3.1 Decomposition of a Long Chain.................................................... 251 13.3.2 Characterization and Optimality................................................. 253 13.3.3 Computing the Performanceof a Long Chain............................ 254 13.4 Performance of Long Chains.................. 257 13.5 Extensions................................................. 257 13.6 Exercises ........................................ 262 14 Supply Chain Planning Models 14.1 Introduction..................................................... 14.2 The Shipper Problem...................................................... 14.2.1 The Shipper Model............................................... 14.2.2 A Set-Partitioning Approach...................................... 14.2.3 Structural Properties............................................ 2θ3 2θ3 2θ^ 2gg 2gg 97η
Contents XV 14.2.4 Solution Procedure....................................................................... 271 14.2.5 Computational Results................................................................. 274 14.3 Safety Stock Optimization...................................................................... 279 14.4 Exercises .................................................................................................... 280 15 Facility Location Models 283 15.1 Introduction................................................................................................. 283 15.2 An Algorithm for the p-Median Problem............................................. 284 15.3 An Algorithm for the Single-Source Capacitated Facility Location Problem............................................................................... 287 15.4 A Distribution System Design Problem................................................. 291 15.5 The Structure of the Asymptotic Optimal Solution............................ 296 15.6 Exercises .................................................................................................... 297 Part IV Vehicle Routing Models 299 16 The 16.1 16.2 16.3 16.4 16.5 Capacitated VRP with Equal Demands 301 Introduction................................................................................................. 301 Worst-Case Analysis of Heuristics........................................................... 303 The Asymptotic Optimal Solution Value............................................... 307 Asymptotically Optimal
Heuristics........................................................ 308 Exercises .................................................................................................... 312 17 The 17.1 17.2 17.3 17.4 Capacitated VRP with Unequal Demands 313 Introduction................................................................................................. 313 Heuristics for the CVRP...........................................................................313 Worst-Case Analysis of Heuristics........................................................... 317 The Asymptotic Optimal Solution Value............................................... 320 17.4.1 A Lower Bound.............................................................................. 321 17.4.2 An Upper Bound........................................................................... 324 Probabilistic Analysis of Classical Heuristics......................................... 326 17.5.1 A Lower Bound.............................................................................. 328 17.5.2 The UOP(a) Heuristic..................................................................330 The Uniform Model ................................................................................. 332 The Location-Based Heuristic..................................................................335 Rate of Convergence to the Asymptotic Value......................................337 Exercises .................................................................................................... 338 17.5 17.6 17.7 17.8 17.9 18 The 18.1 18.2 18.3
18.4 VRP with Time-Window Constraints 341 Introduction................................................................................................. 341 The Model ................................................................................................. 341 The Asymptotic Optimal Solution Value............................................... 343 An Asymptotically Optimal Heuristic .................................................. 349 18.4.1 The Location-Based Heuristic..................................................... 349
Contents xvi 18.4.2 A Solution Method for CVLPTW ......................................... 351 18.4.3 Implementation.............................................................................. 353 18.4.4 Numerical Study....................................................................... 353 18.5 Exercises ............................................................................................... 356 19 Solving the VRP Using a Column-Generation Approach 359 19.1 Introduction........................... 359 19.2 Solving a Relaxation of the Set-Partitioning Formulation .................... 360 19.3 Solving the Set-Partitioning Problem...................................................... 364 19.3.1 Identifying Violated Clique Constraints....................................366 19.3.2 Identifying Violated Odd Hole Constraints............ ................... 366 19.4 The Effectiveness of the Set-Partitioning Formulation ...................... 367 19.4.1 Motivation................................................................................. 368 19.4.2 Proof of Theorem 19.4.1............................................................. 369 19.5 Exercises .................................................................................................... 372 Part V Logistics Algorithms in Practice 20 Network Planning 20.1 20.2 20.3 20.4 20.5 20.6 403 Introduction..................... 403 The Setting.............................................................................. 404 Literature Review ........................................ 40g The Problem in New York
City............................... 407 Distance and Time Estimation................................................................ 4O9 The Routing Algorithm..................... 444 Additional Constraints and Features....................................................... 445 The Interactive Mode ......................................... 44y Data, Implementation, and Results . . . . 44g References Index 379 Introduction..................................................................................................379 Network Design........................................................................................... 380 Strategic Safety Stock............................................................................... 391 Resource Allocation.............................................................................. 397 Summary.............................. 400 Exercises ..................................................................................................... 402 21 A Case Study: School Bus Routing 21.1 21.2 21.3 21.4 21.5 21.6 21.7 21.8 21.9 377 421 „ 441
|
| any_adam_object | 1 |
| author | Simchi-Levi, David Chen, Xin 1967- Bramel, Julien |
| author_GND | (DE-588)170583783 (DE-588)128608986 (DE-588)173112668 |
| author_facet | Simchi-Levi, David Chen, Xin 1967- Bramel, Julien |
| author_role | aut aut aut |
| author_sort | Simchi-Levi, David |
| author_variant | d s l dsl x c xc j b jb |
| building | Verbundindex |
| bvnumber | BV041830619 |
| callnumber-first | Q - Science |
| callnumber-label | QA402-402 |
| callnumber-raw | QA402-402.37 T57.6-57.97 |
| callnumber-search | QA402-402.37 T57.6-57.97 |
| callnumber-sort | QA 3402 3402.37 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 463 QP 530 |
| classification_tum | WIR 780f |
| ctrlnum | (OCoLC)860394924 (DE-599)BVBBV041830619 |
| dewey-full | 519.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.6 |
| dewey-search | 519.6 |
| dewey-sort | 3519.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik Wirtschaftswissenschaften |
| edition | Third edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02567nam a2200637 c 4500</leader><controlfield tag="001">BV041830619</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220726 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">140506s2014 xx |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461491484</subfield><subfield code="c">print</subfield><subfield code="9">978-1-4614-9148-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)860394924</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041830619</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-862</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402-402.37</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.6-57.97</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.6</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 463</subfield><subfield code="0">(DE-625)141599:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QP 530</subfield><subfield code="0">(DE-625)141897:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90B80</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90-01</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">WIR 780f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90B06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Simchi-Levi, David</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170583783</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The logic of logistics</subfield><subfield code="b">theory, algorithms, and applications for logistics management</subfield><subfield code="c">David Simchi-Levi ; Xin Chen ; Julien Bramel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Heidelberg ; Dordrecht ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">[2014]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xx, 447 Seiten</subfield><subfield code="b">Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Springer series in operations research and financial engineering</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis Seite 421-439</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Industrial engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economics, Mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Unternehmen</subfield><subfield code="0">(DE-588)4061963-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logistikplanung</subfield><subfield code="0">(DE-588)4246866-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logistik</subfield><subfield code="0">(DE-588)4036210-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logistik</subfield><subfield code="0">(DE-588)4036210-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Unternehmen</subfield><subfield code="0">(DE-588)4061963-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Unternehmen</subfield><subfield code="0">(DE-588)4061963-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Logistikplanung</subfield><subfield code="0">(DE-588)4246866-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Xin</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128608986</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bramel, Julien</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173112668</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4614-9149-1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027275512&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027275512</subfield></datafield></record></collection> |
| id | DE-604.BV041830619 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T16:56:00Z |
| institution | BVB |
| isbn | 9781461491484 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027275512 |
| oclc_num | 860394924 |
| open_access_boolean | |
| owner | DE-862 DE-BY-FWS DE-573 DE-83 DE-20 DE-473 DE-BY-UBG |
| owner_facet | DE-862 DE-BY-FWS DE-573 DE-83 DE-20 DE-473 DE-BY-UBG |
| physical | xx, 447 Seiten Diagramme |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Springer |
| record_format | marc |
| series2 | Springer series in operations research and financial engineering |
| spellingShingle | Simchi-Levi, David Chen, Xin 1967- Bramel, Julien The logic of logistics theory, algorithms, and applications for logistics management Mathematik Industrial engineering Economics, Mathematical Mathematics Unternehmen (DE-588)4061963-1 gnd Logistikplanung (DE-588)4246866-8 gnd Logistik (DE-588)4036210-3 gnd Operations Research (DE-588)4043586-6 gnd |
| subject_GND | (DE-588)4061963-1 (DE-588)4246866-8 (DE-588)4036210-3 (DE-588)4043586-6 |
| title | The logic of logistics theory, algorithms, and applications for logistics management |
| title_auth | The logic of logistics theory, algorithms, and applications for logistics management |
| title_exact_search | The logic of logistics theory, algorithms, and applications for logistics management |
| title_full | The logic of logistics theory, algorithms, and applications for logistics management David Simchi-Levi ; Xin Chen ; Julien Bramel |
| title_fullStr | The logic of logistics theory, algorithms, and applications for logistics management David Simchi-Levi ; Xin Chen ; Julien Bramel |
| title_full_unstemmed | The logic of logistics theory, algorithms, and applications for logistics management David Simchi-Levi ; Xin Chen ; Julien Bramel |
| title_short | The logic of logistics |
| title_sort | the logic of logistics theory algorithms and applications for logistics management |
| title_sub | theory, algorithms, and applications for logistics management |
| topic | Mathematik Industrial engineering Economics, Mathematical Mathematics Unternehmen (DE-588)4061963-1 gnd Logistikplanung (DE-588)4246866-8 gnd Logistik (DE-588)4036210-3 gnd Operations Research (DE-588)4043586-6 gnd |
| topic_facet | Mathematik Industrial engineering Economics, Mathematical Mathematics Unternehmen Logistikplanung Logistik Operations Research |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027275512&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT simchilevidavid thelogicoflogisticstheoryalgorithmsandapplicationsforlogisticsmanagement AT chenxin thelogicoflogisticstheoryalgorithmsandapplicationsforlogisticsmanagement AT brameljulien thelogicoflogisticstheoryalgorithmsandapplicationsforlogisticsmanagement |