References

Aggarwal, A. and J. K. Park (1990), Improved Algorithms for Economic Lot-Size Problems. Working Paper, Laboratory for Computer Science, MIT, Cam­bridge, MA.

Aho, A. V., J. E. Hopcroft and J. D. Ullman (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.

Altinkemer, K. and B. Gavish (1987), Heuristics for Unequal Weight Delivery Problems with a Fixed Error Guarantee. Oper. Res. Lett. 6, pp. 149-158.

Altinkemer, K. and B. Gavish (1990), Heuristics for Delivery Problems with Con­stant Error Guarantees. Transportation Sci. 24, pp. 294-297.

Angel, R. D., W. L. Caudle, R. Noonan and A. Whinston (1972), Computer­Assisted School Bus Scheduling. Management Sci. B 18, pp. 279-288.

Anily, S. (1991), Multi-Item Replenishment and Storage Problems (MIRSP): Heuristics and Bounds. Oper. Res. 39, pp. 233-239.

Anily, S. and A. Federgruen (1990), One Warehouse Multiple Retailer Systems with Vehicle Routing Costs. Management Sci. 36, pp. 92-114.

Anily, S., J. Bramel and D. Simchi-Levi (1994), Worst-Case Analysis of Heuristics for the Bin-Packing Problem with General Cost Structures. Oper. Res. 42, pp. 287-298.

Archibald, B. and E. Silver (1978), (s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand. Management Sci. 24, pp. 899-908.

Arkin, E., D. Joneja and R. Roundy (1989), Computational Complexity of Unca­pacitated Multi-Echelon Production Planning Problems. Oper. Res. Lett. 8, pp.61-66.

266 References

Assad, A., B. Golden, R. Dahl and M. Dror (1982), Design of an Inventory/ Routing System for a Large Propane Distribution Firm. C. Gooding, ed., Proc. 1982 Southeast TlMS Conference, Myrtle Beach, pp. 315-320.

Atkins, D. R. and P. Iyogun (1988), A Heuristic with Lower Bound Performance Guarantee for the Multi-Product Dynamic Lot-Size Problem. IIE Transac­tions 20, pp. 369-373.

Azuma, K. (1967), Weighted Sums of Certain Dependent Random Variables. To­hoku Math. J. 19, pp. 357-367.

Baker, B. S. (1985), A New Proof for the First-Fit Decreasing Bin Packing Algo­rithm. J. Algorithms 6, pp. 49-70.

Baker, K. R., P. Dixon, M. J. Magazine and E. A. Silver (1978), An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints. Management Sci. 24, pp. 1710-1720.

Balinski, M. L. (1965), Integer Programming: Methods, Uses, Computation. Man­agement Sci. 12, pp. 253-313.

Balinski, M. L. and R. E. Quandt (1964), On an Integer Program for a Delivery Problem. Oper. Res. 12, pp. 300-304.

Ball, M. 0., T. L. Magnanti, C. L. Monma and G. L. Nernhauser (eds.) (1995), Net­work Routing, Handbooks in Operations Research and Management Science North-Holland, North-Holland, Amsterdam.

Ballou, R. H. (1992), Business Logistics Management. Prentice-Hall, Englewood Cliffs, NJ, 3rd edition.

Barcelo, J. and J. Casanovas (1984), A Heuristic Lagrangian Algorithm for the Capacitated Plant Location Problem. Eur. J. Oper. Res. 15, pp. 212-226.

Beardwood, J., J. L. Halton and J. M. Hammersley (1959), The Shortest Path Through Many Points. Proc. Cambridge Phil. Soc. 55, pp. 299-327.

Beasley, J. (1983), Route First-Cluster Second Methods for Vehicle Routing. Omega 11, pp. 403-408.

Bell, C. (1970), Improved Algorithms for Inventory and Replacement Stock Prob­lems. SIAM J. Appl. Math. 18, pp. 558-566.

Bennett, B. and D. Gazis (1972), School Bus Routing by Computer. Transportation Res. 6, pp. 317-326.

Bertsekas, D. P. (1987), Dynamic Programming. Prentice-Hall, Englewood Cliffs, NJ.

Bertsimas, D. and D. Simchi-Levi (1996), The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Oper. Res. 44, pp. 286-304.

Bienstock, D. and D. Simchi -Levi (1993), A Note on the Prize Collecting Traveling Salesman Problem. Working Paper, Columbia University.

Bienstock, D., J. Bramel and D. Simchi-Levi (1993), A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Math. Oper. Res. 18, pp. 786-802.

Bienstock, D., M. Goemans, D. Simchi-Levi and D. Williamson (1993), A Note on the Prize Collecting Traveling Salesman Problem. Math. Programming, 59, pp. 413-420.

References 267

Bodin, L. and L. Berman (1979), Routing and Scheduling of School Buses by Computer. Transportation Sci. 13, pp. 113-129.

Braca, J., J. Bramel, B. Posner and D. Simchi-Levi (1994), A Computerized Ap­proach to the New York City School Bus Routing Problem. To appear in IIE Transactions.

Bramel, J. and D. Simchi-Levi (1994), On the Effectiveness of Set Partitioning Formulations for the Vehicle Routing Problem. To appear in Oper. Res ..

Bramel, J. and D. Simchi-Levi (1995), A Location Based Heuristic for General Routing Problems. Oper. Res. 43, pp. 649-660.

Bramel, J. and D. Simchi-Levi (1996), Probabilistic Analysis and Practical Algo­rithms for the Vehicle Routing Problem with Time Windows. Oper. Res. 44, pp.501-509.

Bramel, J., E. G. Coffman Jr., P. Shor and D. Simchi-Levi (1991), Probabilistic Analysis of Algorithms for the Capacitated Vehicle Routing Problem with Unsplit Demands. Oper. Res. 40, pp. 1095-1106.

Chan, L. M. A. and D. Simchi-Levi (1996), Probabilistic Analysis and Practical Al­gorithms for Multi-Echelon Distribution Models. Submitted to Management Sci ..

Chan, L. M. A., A. Federgruen and D. Simchi-Levi (1996), Probabilistic Analysis and Practical Algorithms for Inventory Routing Models. To appear in Oper. Res ..

Chan, L. M. A., D. Simchi-Levi and J. Bramel (1995), Worst-Case Analyses, Linear Programming and the Bin-Packing Problem. To appear in Math. Pro­gramming.

Chandra, P. and M. L. Fisher (1990), Coordination of Production and Distribu­tion Planning. Working Paper, 90-11-06, The Wharton School, University of Pennsylvania.

Chandra, B., H. Karloff and C. Tovey (1995), New Results on the Old k-Opt Algorithm for the TSP. Working Paper, University of Chicago.

Chapleau, L., J. A. Ferland and J.-M. Rousseau (1983), Clustering for Routing in Dense Area. Eur. J. Oper. Res. 20, pp. 48-57.

Chen, F. and Y. S. Zheng (1994), Lower Bounds for Multi-Echelon Stochastic Inventory Systems. Management Sci. 40, pp. 1426--1443.

Chen, Y. F. (1996), On the Optimality of (s, S) Policies for Quasiconvex Loss Functions. Working Paper, Northwestern University.

Chien, T. w., A. Balakrishnan and R. T. Wong (1989), An Integrated Inventory Allocation and Vehicle Routing Problem. Transportation Sci. 23, pp. 67-76.

Christofides, N. (1976), Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem. Report 388, Graduate School of Industrial Administra­tion, Carnegie-Mellon University, Pittsburgh, PA.

Christofides, N. (1985), Vehicle Routing. In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), John Wiley & Sons Ltd., New York, pp. 431-448.

Christofides, N., A. Mingozzi and P. Toth (1978), The Vehicle Routing Problem.

268 References

In Combinatorial Optimization, Christofides, N., A. Mingozzi, P. Toth and C. Sandi (eds.), John Wiley & Sons Ltd., New York, pp. 318-338.

Christofides, N., A. Mingozzi and P. Toth (1981), Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Math. Programming 20, pp. 255-282.

Churchman, C. W., R. L. Ackoff and E. L. Arnoff (1957), Introduction to Opera­tions Research. John Wiley & Sons Ltd., New York.

Clark, A. J. and H. E. Scarf (1960), Optimal Policies for a Multi-Echelon Inventory Problem. Management Sci. 6, pp. 475-490.

Clarke, G. and J. W. Wright (1964), Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Oper. Res. 12, pp. 568-581.

Coffman, E. G. Jr. and G. S. Lueker (1991), Probabilistic Analysis of Packing and Partitioning Algorithms, John Wiley & Sons Ltd., New York.

Comuejols, G. and E Harche (1993), Polyhedral Study of the Capacitated Vehicle Routing Problem. Math. Programming 60, pp. 21-52.

Comuejols, G., M. L. Fisher and G. L. Nemhauser (1977), Location of Bank Accounts to Optimize Float: An Analytical Study of Exact and Approximate Algorithms. Management Sci. 23, pp. 789-810.

Council on Logistics Management, mission statement, Council on Logistics Man­agement Web Site, www • elml. org/mission. html.

Cullen, E, J. Jarvis and D. Ratliff (1981), Set Partitioning Based Heuristics for Interactive Routing. Networks 11, pp. 125-144.

Daskin, M. S. (1995), Network and Discrete Location: Models Algorithms and Applications. John Wiley & Sons Ltd., New York.

Dematteis, J. J. (1968), An Economic Lot Sizing Technique: The Part-Period Al­gorithm. IBM Syst. J. 7, pp. 30-38.

Denardo, E. V. (1996), Dynamic Programming. In Mathematical Programming for Industrial Engineers, Avriel, M. and B. Golany (eds.), Marcel Dekker, Inc., Englewood Cliffs, NJ, pp. 307-384.

Deng, Q. and D. Simchi-Levi (1992), Valid Inequalities, Facets and Computa­tional Results for the Capacitated Concentrator Location Problem. Columbia University, Working paper.

Desrochers, M., J. Desrosiers and M. Solomon (1992), A New Optimization Al­gorithm for the Vehicle Routing Problem with Time Windows. Oper. Res. 40, pp. 342-354.

Desrosiers, J., J. A. Ferland, J.-M. Rousseau, G. Lapalme andL. Chapleau (1986), TRANS COL: A Multi-Period School Bus Routing and Scheduling System. TIMS Stud. Management Sci. 22, pp. 47-71.

Dobson, G. (1987), The Economic Lot Scheduling Problem: A Resolution of Feasibility Using Time Varying Lot Sizes. Oper. Res. 35, pp. 764-771.

Dreyfus, S. E. and A. M. Law (1977), The Art and Theory of Dynamic Program­ming. Academic Press, Inc., New York.

Dror, M. and M. Ball (1987) Inventory/Routing: Reduction from an Annual to a Short-Period Problem. Naval Research Logistics 34, pp.891-905.

References 269

Dror, M., M. Ball and B. Golden (1986), A Computational Comparison of Algorithms for the Inventory Routing Problem. Ann. Oper. Res. 4, pp. 3-23.

Edmonds, J. (1965), Maximum Matching and a Polyhedron with O,l-Vertices. J. Res. Nat. Bur. Standards 69B, pp. 125-130.

Edmonds, J. (1971), Matroids and the Greedy Algorithm. Math. Programming 1, pp.127-136.

Eppen, G. and L. Schrage (1981), Centralized Ordering Policies in a Multiware­house System with Lead Times and Random Demand. In Multi-Level Pro­duction/Inventory Control Systems: Theory and Practice, Schwarz, L. (Ed.), North-Holland Publishing Company, Amsterdam.

Erlenkotter, D. (1990), Ford Whitman Harris and the Economic Order Quantity Model. Oper. Res. 38, pp. 937-946.

Federgruen, A. and G. van Ryzin (1992), Probabilistic Analysis of a Generalized Bin Packing Problem with Applications to Vehicle Routing and Scheduling Problems. To appear in Oper. Res ..

Federgruen, A. and D. Simchi-Levi (1995), Analytical Analysis of Vehicle Rout­ing and Inventory Routing problems. In Handbooks in Operations Research and Management Science, the volume on Network Routing, Ball, M. 0., T. L. Magnanti, C. L. Monma and G. L. Nemhauser (eds.), North-Holland, Ams­terdam, pp. 297-373.

Federgruen, A. and M. Tzur (1991), A Simple Forward Algorithm to Solve Gen­eral Dynamic Lot Sizing Models with n periods in O(n logn) or O(n) time. Management Sci. 37, pp. 909-925.

Federgruen, A. and Y. S. Zheng (1992) The Joint Replenishement Problem with General Joint Cost Structures. Oper. Res. 40, pp. 384-403.

Federgruen, A. and P. Zipkin (1984), A Combined Vehicle Routing and Inventory Allocation Problem. Oper. Res. 32, pp. 1019-1032.

Federgruen, A. and P. Zipkin (1984a), Approximation of Dynamic, Multi-Location Production and Inventory Problems. Management Sci. 30, pp. 69-84.

Federgruen, A. and P. Zipkin (1984b), Computational Issues in the Infinite Horizon, Multi-Echelon Inventory Model. Oper. Res. 32, pp. 818-836.

Federgruen, A. and P. Zipkin (1984c), Allocation Policies and Cost Approximation for Multi-Location Inventory Systems. Naval Research Logistics Quart. 31, pp.97-131.

Few, L. (1955), The Shortest Path and the Shortest Road through n Points. Math­ematika 2, pp. 141-144.

Fisher, M. L. (1980), Worst-Case Analysis of Algorithms. Management Sci. 26, pp.l-17.

Fisher, M. L. (1981), The Lagrangian Relaxation Method for Solving Integer Pro­gramming Problems. Management Sci. 27, pp. 1-18.

Fisher, M. L. (1994), Optimal Solution of Vehicle Routing Problems Using Mini­mum K-Trees. Oper. Res. 42, pp. 626-642.

Fisher M. L. (1995), Vehicle Routing. In Handbooks in Operations Research and Management Science, the volume on Network Routing, Ball, M. 0., T. L.

270 References

Magnanti, C. L. Monma and G. L. Nemhauser (eds.), North-Holland, Ams­terdam, pp. 1-33.

Fisher, M. L. and R. Jaikumar (1981), A Generalized Assignment Heuristic for Vehicle Routing. Networks 11, pp. 109-124.

Florian, M. and M. Klein (1971), Deterministic Production Planning with Concave Costs and Capacity Constraints. Management Sci. 18, pp. 12-20.

Florian, M., J. K. Lenstra and A. H. G. Rinnooy Kan (1980), Deterministic Produc­tion Planning: Algorithms and Complexity. Management Sci. 26, pp. 669-679.

Gallego, G. and D. Simchi-Levi (1990), On the Effectiveness of Direct Shipping Strategy for the One Warehouse Multi-Retailer R-Systems. Management Sci. 36, pp. 240-243.

Gallego, G., M. Queyranne and D. Simchi-Levi (1996), Single Resource Multi­Item Inventory System. Oper. Res. 44, pp. 580-595.

Garey, M. R. and D. S. Johnson (1979), Computers and Intractability. W. H. Freeman and Company, New York.

Garey, M. R., R. L. Graham, D. S. Johnson and A. C. Yao (1976), Resource Con­strained Scheduling as Generalized Bin Packing. J. Combinatorial Theory Ser. A 21, pp. 257-298.

Gaskel, T. J. (1967), Bases for Vehicle Fleet Scheduling. Oper. Res. Quart. 18, pp. 281-295.

Gillett, B. E. and L. R. Miller (1974), A Heuristic Algorithm for the Vehicle Dispatch Problem. Oper. Res. 22, pp. 340-349.

Goemans M. X. and D. J. Bertsimas (1993), Survivable Networks, Linear Pro­gramming Relaxations and the Parsimonious Property. Math. Programming 60, pp. 145-166.

Golden, B. L. and W. R. Stewart (1985), Empirical Analysis of Heuristics. In The Traveling Salesman Problem: A Guided Tour o/Combinatorial Optimization, Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), John Wiley & Sons Ltd., New York, pp. 207-249.

Golden, B. L., A. Assad and R. Dahl (1984), Analysis of a Large Scale Vehicle Routing Problem with Inventory Component. Large Scale System 7, pp. 181-190.

Goyal, S. K. (1978), A Note On "Multi-Product Inventory Situation with One Restriction." J. Opl. Res. Soc. 29, pp. 269-271.

Graves, S. C. and L. B. Schwarz (1977), Single Cycle Continuous Review Poli­cies for Arborescent Production/Inventory Systems. Management Sci. 23, pp. 529-540.

Graves, S. c., A. H. G. Rinnooy Kan and P. H. Zipkin (eds.) (1993), Logistics of Production and Inventory. In Handbooks in Operations Research and Man­agement Science, North-Holland, Amsterdam.

Hadley, G. and T. M. Whitin (1963), Analysis o/Inventory Systems. Prentice-Hall, Englewood Cliffs, NJ.

Haimovich, M. and A. H. G. Rinnooy Kan (1985), Bounds and Heuristics for Capacitated Routing Problems. Math. Oper. Res. 10, pp. 527-542.

References 271

Haimovich, M., A. H. G. Rinnooy Kan and L. Stougie (1988), Analysis of Heuris­tics for Vehicle Routing Problems. In Vehicle Routing: Methods and Studies, Golden, B. L. and A. A. Assad (eds.), Elsevier Science Publishers, B.V., pp. 47-61.

Hakimi, S. L. (1964), Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph. Oper. Res. 12, pp. 450-459.

Hall, N. G. (1988), A Multi-Item EOQ Model with Inventory Cycle Balancing. Naval Research Logistics 35, pp. 319-325.

Hariga, M. (1988), The Warehouse Scheduling Problem. Ph. D. Thesis, School of Operations Research and Industrial Engineering, Cornell University.

Harris, F. (1915), Operations and Costs. Factory Management Series, A. W. Shaw Co., Chicago, IL, pp. 48-52.

Hartley, R. and L. C. Thomas (1982), The Deterministic, Two-Product, Inventory System with Capacity Constraint. J. Opl. Res. Soc. 33, pp. 1013-1020.

Hax, A. C. and D. Candea (1984), Production and Inventory Management. Prentice­Hall, Englewood Cliffs, NJ.

Held, M. andR. M. Karp (1962), A Dynamic Programming Approach to Sequenc­ing Problems. SIAM J. Appl. Math. 10, pp. 196-210.

Held, M. and R. M. Karp (1970), The Traveling Salesman Problem and Minimum Spanning Trees. Oper. Res. 18, pp. 1138-1162.

Held, M. and R. M. Karp (1971), The Traveling Salesman Problem and Minimum Spanning Trees: Part II. Math. Programming 1, pp. 6-25.

Herer, Y. and R. Roundy (1990), Heuristics for a One Warehouse Multi-Retailer Distribution Problem with Performance Bounds. Technical Report No. 916, Cornell University, Ithaca, NY.

Heyman, D. P. and M. J. Sobel (1984), Stochastic Models in Operations Research. Vol I, McGraw-Hill, New York.

Hodgson, T. J. and T. J. Howe (1982), Production Lot Sizing with Material­Handling Cost Considerations. lIE Trans. 14, pp. 44-51.

Hoffman, K. L. and M. Padberg (1993), Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Sci. 39, pp. 657-682.

Holt, C. C. (1958), Decision Rules for Allocating Inventory to Lots and Cost Foundations for Making Aggregate Inventory Decisions. J. Ind. Engn. 9, pp. 14-22.

Homer, E. D. (1966), Space-Limited Aggregate Inventories with Phased Deliver­ies. J. Ind. Engn. 17, pp. 327-333.

House, R. G. and K. D. Jamie (1981), Measuring the Impact of Alternative Market Classification Systems in Distribution Planning. J. Business Logistics 2, pp. 1-31.

Iglehart, D. (1963a), Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem. Management Sci. 9, pp. 259-267.

Iglehart, D. (1963b), Dynamic Programming and Stationary Analysis in Inventory Problems. In Multi-Stage Inventory Models and Techniques, Scarf H., D. Guilford and M. Shelly (eds.). Stanford University Press, Stanford CA, pp. 1-31.

272 References

Jackson, P. L., W. L. Maxwell and J. A. Muckstadt (198S), The Joint Replenishe­ment Problem with Powers of Two Restrictions. AIlE Trans. 17, pp. 2S-32.

Jaillet, P. (198S), Probabilistic Traveling Salesman Problem. Ph.D. Dissertation. Operations Research Center, Massachusetts Institute of Technology, Cam­bridge, MA.

Johnson, D. S. and C. H. Papadimitriou (198S), Performance Guarantees for Heuristics. In The Traveling Salesman Problem: A Guided Tour of Com­binatorial Optimization, Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), John Wiley & Sons Ltd., New York, pp. 14S-180.

Johnson, D. S., A. Demers, J. D. Ullman, M. R. Garey and R. L. Graham (1974), Worst-Case Performance Bounds for Simple One-Dimensional Packing Al­gorithms. SIAM J. Comput., 3, pp. 299-32S.

Johnson, J. C. and D. F. Wood (1986), Contemporary Physical Distribution and Logistics. Macmillan, New York, 3rd edition.

Joneja, D. (1990), The Joint Replenishment Problem: New Heuristics and Worst­Case Performance Bounds. Oper. Res. 38, pp. 711-723.

Jones, P. C. and R. R. Inman (1989), When is the Economic Lot Scheduling Prob­lem Easy? IIE Trans. 21, pp. 11-20.

Karlin, S. and H. M. Taylor (197S), A First Course in Stochastic Processes Aca­demic Press, Inc., San Diego, CA.

Karmarkar, N. (1982), Probabilistic Analysis of Some Bin-Packing Algorithms. Proc. 23rd Ann. Symp. Foundat. Comput. Sci., pp. 107-111.

Karp, R. M. (1977), Probabilistic Analysis of Partitioning Algorithms for the Trav­eling Salesman Problem. Math. Oper. Res. 2, pp. 209-224.

Karp, R. M. and J. M. Steele (198S), Probabilistic Analysis of Heuristics. In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), John Wiley & Sons Ltd., New York, pp. 181-20S.

Karp, R. M., M. Luby and A. Marchetti-Spaccamela (1984), A probabilistic anal­ysis of multidimensional bin packing problems. Proc. Sixteenth Annual ACM Symposium on Theory of Computing, pp. 289-298.

Kingman, J. F. C. (1976), Subadditive Processes. Lecture Notes in Math. 539, Springer-Verlag, Berlin, pp. 168-222.

Klincewicz, J. G. and H. Luss (1986), A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints. J. Opt. Res. Soc. 37,pp. 49S-S00.

Kuehn, A. A. and M. J. Hamburger (1963), A Heuristic Program for Location Warehouses. Management Sci. 9, pp. 643-666.

Lawler, E. L. (1976), Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.

Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (1993), Sequencing and Scheduling: Algorithms and Complexity. In Handbooks in Operations Research and Management Science, the volume on Logistics of Production and Inventory, Graves, S. c., A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), North-Holland, Amsterdam, pp. 44S-S22.

References 273

Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.) (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd., New York.

Lee, H. L. and S. Nahmias (1993), Single Product, Single Location Models. In Handbooks in Operations Research and Management Science, the volume on Logistics of Production and Inventory, Graves, S. c., A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), North-Holland, Amsterdam, pp. 3-55.

Li, C. L. and D. Simchi-Levi (1990), Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems. ORSA J. Comput. 2, pp. 64-73.

Lindsey (1996), A communication to the AGIS-L list server. Lovasz, L. (1979), Combinatorial Problems and Exercises. North-Holland, Ams­

terdam. Love, S. F. (1973), Bounded Production and Inventory Models with Piecewise

Concave Costs. Management Sci. 20, pp. 313-318. Manne, A. S. (1964), Plant Location Under Economies of Scale-Decentralization

and Computation. Management Sci. 11, pp. 213-235. Maxwell, W. L. and H. Singh (1983), The Effect of Restricting Cycle Times in the

Economic Lot Scheduling Problem. lIE Trans. 15, pp. 235-241. Mirchandani, P. B. and R. L. Francis (1990), Discrete Location Theory. John Wiley

& Sons Ltd., New York. Muckstadt, J. M. and R. O. Roundy (1993), Analysis of Multistage Production

Systems. In Handbooks in Operations Research and Management Science, the volume on Logistics of Production and Inventory, Graves, S. c., A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), North-Holland, Amsterdam, pp. 59-131.

Nauss, R. M. (1976), An Efficient Algorithm for the 0-1 Knapsack Problem. Man­agement Sci. 23, pp. 27-31.

Neebe, A. W. and M. R. Rao (1983), An Algorithm for the Fixed-Charged Assign­ing Users to Sources Problem. J. Opl. Res. Soc. 34, pp. 1107-1113.

Newton, R. M. and W. H. Thomas (1969), Design of School Bus Routes by Com­puter. Socio-Economic Planning Sci. 3, pp. 75-85.

Page, E. and R. J. Paul (1976), Multi-Product Inventory Situations with One Re­striction; J. Opl. Res. Soc. 27, pp. 815-834.

Papadimitriou, C. H. and K. Stieglitz (1982), Combinatorial Optimization: Algo­rithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ.

Park, K. S. and D. K. Yun (1985), Optimal Scheduling of Periodic Activities. Oper. Res. 33,pp. 690-695.

Patton, E. P. (1994), Carrier Rates and Tariffs. In The Distribution Management Handbook, Tompkins, J. A., and D. Harmelink (eds.), McGraw-Hill, NY, Chapter 12.

Pinedo, M. (1995), Scheduling: Theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs, NJ.

Pirkul, H. (1987), Efficient Algorithms for the Capacitated Concentrator Location Problem. Com put. Oper. Res. 14, pp. 197-208.

274 References

Pirkul, H. and V. Jayaraman (1996), Production, Transportation and Distribution Planning in a Multi-Commodity Tri-Echelon System. Transportation Sci. 30, pp.291-302.

Polyak, B. T. (1967), A General Method for Solving Extremum Problems (in Russian). Doklady Akademmi Nauk SSSR 174 ,pp. 33-36.

Porteus, E. L. (1985), Investing in Reduced Setups in the EOQ Model. Management Science 31, pp. 998-1010. Porteus, E. L. (1990), Stochastic Inventory Theory. In Handbooks in Operations Research and Management Science, the volume on Stochastic Models, Heyman, D. P., and M. J. Sobel (eds.), North-Holland, Amsterdam, pp. 605-652.

Psaraftis, H. N. (1984), On the Practical Importance of Asymptotic Optimality in Certain Heuristic Algorithms. Networks 14, pp. 587-596.

Rhee, W. T. (1988), Optimal Bin Packing with Items of Random Sizes. Math. Oper. Res. 13, pp. 140-151.

Rhee, W. T. (1991), An Asymptotic Analysis of Capacitated Vehicle Routing. Working Paper, The Ohio State University, Columbus, OH.

Rhee, W. T. and M. Talagrand (1987), Martingale Inequalities and NP-Complete Problems. Math. Oper. Res. 12, pp. 177-181.

Robeson, J. F. and W. C. Copacino (eds.) (1994), The Logistics Handbook. Free Press, New York.

Rosenblatt, M. and U. Rothblum (1990), On the Single Resource Capacity Problem for Multi-Item Inventory Systems. Oper. Res. 38, pp. 686-693.

Rosenkrantz, D. J., R. E. Stearns and P. M. Lewis II (1977), An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput. 6, pp. 563-581.

Rosling, K. (1989), Optimal Inventory Policies for Assembly Systems Under Ran­dom Demand. Oper. Res. 37, pp. 565-579.

Ross, S. (1970), Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.

Roundy, R. (1985), 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems. Management Sci. 31, pp. 1416-1430.

Russell, R. A. (1977), An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Constraints. Oper. Res. 25, 521-524.

Sahni, S. and T. Gonzalez (1976), P-Complete Approximation Algorithms. J. As­soc. Comput. Mach. 23, pp. 555-565.

Scarf, H. E. (1960), The Optimalities of (s, S) Policies in the Dynamic Inventory Problem. In Mathematical Methods in the Social Sciences, Arrow, K., S. Karlin and P. Suppes (eds.), Stanford University Press, Stanford, CA, pp. 196-202.

Shmoys, D. and D. Williamson (1990), Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. Inf. Process. Lett. 35, pp. 281-285.

Silver, E. A. (1976), A Simple Method of Determining Order Quantities in Joint Re­plenishments Under Deterministic Demand. Management Sci. 22, pp. 1351-1361.

Silver, E. A. and H. C. Meal (1973), A Heuristic for Selecting Lot Size Quan-

References 275

tities for the Case of a Deterministic Time-Varying Demand Rate and Dis­crete Opportunities for Replenishment. Prod. Invent. Management 14, pp. 64-74.

Silver E. A. and R. Peterson (1985), Decision Systems for Inventory Management and Production Planning. John Wiley & Sons Ltd., New York.

Simchi-Levi, D. (1994), New Worst Case Results for the Bin-Packing Problem. Naval Research Logistics 41, pp. 579-585.

Simchi-Levi, D. and J. Bramel (1990), On the Optimal Solution Value of the Capacitated Vehicle Routing Problem with Unsplit Demands. Working Paper, Department of IE&OR, Columbia University, New York.

Simchi-Levi, D., P. Kaminsky and E. Simchi-Levi (1997), Managing the Supply Chain: A Structured Approach. Irwin, Burr Ridge, IL.

Solomon, M. M. (1986), On the Worst-Case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Networks 16, pp. 161-174.

Solomon, M. M. and J. Desrosiers (1988), Time Window Constrained Routing and Scheduling Problems: A Survey. Transportation Sci. 22, pp. 1-13.

Stalk, G., P. Evans, and L. E. Shulman (1992), Competing on Capabilities: The New Rule of Corporate Strategy. Harvard Bus. Rev. 70, No.2, pp. 57-69.

Steele, J. M. (1981), Subadditive Euclidean Functionals and Nonlinear Growth Geometric Probability. The Annals of Probability 9, pp. 365-375.

Steele, J. M. (1990), Lecture Notes on "Probabilistic Analysis of Algorithms." Stout, W. F. (1974), Almost Sure Convergence. Academic Press, Inc., NY. Swersey, A. J. and W. Ballard (1984), Scheduling School Buses. Management Sci.

30, pp. 844-853. Thomas, L. C. and R. Hartley (1983), An Algorithm for Limited Capacity Inventory

Problem with Staggering. J. Opt. Res. Soc. 34, pp. 81-85. Veinott, A. (1966), On the Optimality of (s, S) Inventory Policies: New Condition

and a New Proof. J. SIAM Appt. Math. 14, pp. 1067-1083. Veinott, A. and H. Wagner (1965), Computing Optimal (s, S) Inventory Policies.

Management Sci. 11, pp. 525-552. Viswanathan S. and K. Mathur (1993), Integrating Routing and Inventory Deci­

sions in One Warehouse Multi-Retailer Multi-Product Distribution Systems. Working paper.

Wagelmans, A., S. Van Hoesel and A. Kolen (1992), Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case. Oper. Res. 40, Suppl. No.1, pp. SI45-S156.

Wagner, H. M. and T. M. Whitin (1958), Dynamic Version of the Economic Lot Size Model. Management Sci. 5, pp. 89-96.

Weber, A. (1909), Theory of the Location of Industries. (Friedrich, C. J., ed. and transl.) Chicago University Press, Chicago, IL.

Wolsey, L. (1980), Heuristic Analysis, Linear Programming and Branch and Bound. Math. Prog. Study 13, pp. 121-134.

Yellow, P. (1970), A Computational Modification to the Savings Method of Vehicle Scheduling. Oper. Res. Quart. 21, pp. 281-283.

276 References

Zangwill, w.1. (1966), A Detenninistic Multi-Period Production Scheduling Model with Backlogging. Management Sci. 13, No.1, pp. 105-199.

Zavi, A. (1976), Introduction to Operations Research, Part II: Dynamic Program­ming and Inventory Theory (in Hebrew). Dekel, Tel-Aviv, Israel.

Zheng, Y. S. (1991), A Simple Prooffor the Optimality of (s, S) Policies for Infinite Horizon Inventory Problems. 1. Appl. Prob. 28 pp. 802-810.

Zheng, Y. S. and A. Federgruen (1991), Finding Optimal (s, S) Policies is About as Simple as Evaluating a Single Policy. Oper. Res. 39, pp. 654-665.

Zipkin, P. H. (1997), Foundations of Inventory Management. Irwin, Burr Ridge, IL.

Zoller, K. (1977), Detenninistic Multi-Item Inventory Systems with Limited Ca­pacity. Management Sci. 24, pp. 451-455.

Index

(s, S) policy, 181 K -convex, 183 k-connected, 62 k-opt procedures, 29 p -Median Problem, 203-207, 208-210, 213,

217 I-tree, 57 2-Partition Problem, 17

Absolute perfonnance ratio, 15 Aggarwal, A., 167 Abo,A. V.,23 Altinkemer, K., 70, 85 Angel, R. D., 242 Anily, S., 34, 151, 222 Archibald, B., 192 Arkin, E., 176 Assad, A., 220 assembly-distribution system, 196 asymptotic perfonnance ratio, 15 asymptotically optimal, 40 Atkins, D. R., 176 Average-case analysis, 9

and the Bin-Packing Problem, 38-43 and the Traveling Salesman Problem,

43-48 and the ECVRP, 75-79 and the UCVRP, 88-105 and the VRPTW, 109-114

and the Distribution System Design Problem, 215-216

and Zero-Inventory Ordering Policies, 225-232

and Cross-Docking, 232-234 Azuma,K.,41

Baker, B. S., 17 Baker, K. R., 171 Balinski, M. L., 125,204 Ball, M. 0., 9, 220 Ballard, W., 243 Ballou, R. H., 256, 258 Barcelo, J., 209 base planning period, 149 Beardwood, J., 44, 99 Beasley, J., 74, 83 Bell, C., 192 Bennett, B., 242,253 Bennan, L., 242, 248 Bertsekas, D. P., 185 Bertsimas, D. J., 61,81 Best-Fit, 16 Best-Fit Decreasing, 16 Biepstock, D., 62, 94 bin-packing constant, 88, 216 Bin-Packing Problem, 15-21,38-43,51-55,

88,99,138,217,228-230 Bodin, L., 242, 248 Borel-Cantelli Lemma, 98

278 Index

Bramel, J., 84, 88, 102, 104, 105, 107, 133, 222,249

branch and bound, 130

Candea, D., 3 Capacitated Concentrator Location Problem,

208 Capacitated Facility Location Problem, 103,

115 Capacitated Vehicle Location Problem with

Time Windows, 115 Capacitated Vehicle Routing Problem with

Unequal Demands (UCVRP), 81-106 Capacitated Vehicle Routing Problem with

Equal Demands (ECVRP), 69-80 Casanovas, J., 209 Chan, L. M. A., 55, 222, 230 Chandra, P., 31, 220 Chapleau, L., 248 Chen, F., 179, 188, 195, 196 Chien, T. w., 220 Christofides' Heuristic, 28, 32, 63, 73, 80 Christofides, N., 28,81,84,129 Churchman, C. W., 151 circuitry factor, 260 Circular region partitioning, 77-79 Clark, A. J., 179 Clarke, G., 82, 242 clique, 131 cluster first-route second, 84 Coffman, E. G., Jr., 37, 50,105 column generation, 126 consecutive heuristic, 94 Copacino, W. C., 256 Cornuejols, G., 85,204 Council of Logistics Management, 1 crew-scheduling problems, 130 Cullen, F., 126 Cutting Plane Methods, 85 cycle time, 147

Daskin, M. S., 204 data aggregation, 257 decision support system, 256 Delivery Man Problem, 122 Dematteis, J. J., 167 Denardo, E. V., 192 Deng, Q., 104 depth-first search, 23 Desrochers, M., 120, 126, 133 Desrosiers, J., 107, 243 Direct shipping, 222-223

Distance and Time Estimation, 245-247, 259-260

Distribution System Design Problem, 211-216

Dobson, G., 152 Dreyfus, S. E., 50,185,186 Dror, M., 220 dual-feasible, 64 dynamic programming, 45, 50, 129, 140

Echelon holding cost, 159 echelon inventory position, 195 Economic Lot Scheduling Problem, 152 Economic Lot Size Model, 145, 163 Economic Order Quantity (EOQ), 147, 163 Economic Warehouse Lot Scheduling

Problem, 151 Edmonds, J., 60, 64 Eppen, G., 179, 195 Erlenkotter, D., 145 Eulerian graph, 28, 46 Eulerian tour, 28

Federgruen, A., 81,107,167,179,192,195, 220-222 Few, L., 43 First-Fit, 16 First-Fit Decreasing, 16 Fisher, M. L., 8, 9, 55, 81,84, 85, 104,220 Fixed Partition Policies, 222 Florian, M., 171 Francis, R. L., 204, 217

Gallego, G., 152, 222 Garey, M. R., 8,16,18 Gaskel, T. J., 83 Gavish, B., 70, 85 Gazis, D., 242, 253 Generalized Assignment Heuristic, 84, 104 geocoding, 245 geographic information system, 241, 245,

259 Gillett, B. E., 83 Goemans, M. X., 61 Golden, B. L., 31, 220 Gonzalez, T., 22 Goyal, S. K., 151 Graves, S. C., 9, 158

Hadley, G., 151, 156 Haimovich, M., 70, 75, 77, 85 Hakimi, S. L., 204 Hall, N. G., 151

Hamburger, M. J., 204 Hamiltonian Cycle Problem, 22 Hamiltonian Path, 32 Harche, E, 85 Hariga, M., 152 Harmonic heuristic, 49 Harris, E, 145 Hartley, R., 151 Hax,A.C., 3 Held, M., 45, 55, 57, 58, 60 Held-Karp Lower Bound, 57-64 Herer, Y., 222 Heyman, D. P., 195 Hodgson, T. J., 151 Hoffman, K. L., 126, 130 Holt, C. c., 151 Homer, E. D., 151 House, R. G., 258 Howe, T. J., 151

Iglehart, D., 179, 187, 192 Incomplete Optimization Methods, 85 independent set, 131 Independent Solutions, 151 Inman, R. R., 152 integrality property, 57 intersection graph, 131 Inventory Decomposition Property, 171 inventory position, 195 inventory turnover ratio, 260 inventory-balance constraints, 166 Iterated Tour Partitioning, 70 Iyogun, P., 176

J. C. Penney, 258 Jackson, P. L., 221 Jaikumar, R., 84, 104 Jaillet, P., 43 Jamie, K. D., 258 Jayaraman, Y., 212 Johnson, D. S., 8,16-18,22,24 Johnson, J. C., 256, 259 Joint Replenishment Problems, 221 joint set-up cost, 176 Joneja, D., 176 Jones, P. C., 152

Karlin, S., 41 Karmarkar, N., 89, 95 Karp, R. M., 45, 49, 55, 57, 58, 60 Kingman, J. E c., 38 Klein, M., 171 Klincewicz, J. G., 209

Index 279

Knapsack Problem, 209, 214 Kuehn, A. A., 204

Lagrangian dual, 56 Lagrangian relaxation, 55-60, 104, 117, 204,

205,209,213 Law, A. M., 50,185,186 Lawler, E. L., 22, 29, 100, 108 layered graph, 132 Lee, H. L., 179 Leuker, G. S., 50 Li, C. L., 73, 87 Lindsey, A., 259 Location-Based Heuristic, 84, 102-105,

115-122 loss function, 182 Lovasz, L., 62 Love, S. E, 171 Lueker, G. S., 37, 105 Luss, H., 209

Machine scheduling problem, 108 Manne, A. S., 204 martingale inequalities, 41 MATCH Heuristic, 41 matching, 29 Mathur, K., 222 Maxwell, W. L., 225 Miller, L. R., 83 Minimum K-Tree Methods, 85 Minimum Spanning Tree Based Heuristic, 24 Mirchandani, P. B., 204, 217 Muckstadt, J. M., 149

Nahmias, S., 179 Nauss, R. M., 209 Nearest Insertion Heuristic, 26 Nearest Neighbor Heuristic, 24, 122 Neebe, A. W., 209 nested,158 network design, 61 newsboy problem, 180 Newton, R. M., 242 Next-Fit, 33, 94 Next-Fit Increasing, 34 Node Cover Problem, 217 NP-Complete, 17,22,51,171,176 NP-Hard,8, 15, 104,117, 128,217

Odd hole, 131 offline algorithms, 16 online algorithms, 16 Optimal Matching of Pairs, 99, 101

280 Index

Optimal Partitioning, 74,83,87 order-up-to-Ievel,181

Padberg, M., 126, 130 Page, E., 151 Papadimitriou, C. H., 22-24, 32, 33 Park, J. K., 167 Park, K. S., 151 parsimonious property, 61 Part-Period Balancing Heuristic, 167 Patton, E. P., 259 Paul, R. J., 151 perfect packing, 89,228,229,233,234 Peterson, E., 152 Pick Up and Delivery Problem, 123 Pinedo, M., 108 Pirkul, H., 103,209,212 planning horizon, 165 Polar region partitioning, 77, 78 Polyak, B. T., 56 Porteus, E. L., 164, 179, 192 power-of-two policies, 149-150 power-of-two strategies, 222 Prize-Collecting Traveling Salesman

Problem, 138 probabilistic analysis, 37 production sequence, 171 Psaraftis, H. N., 105

Quandt, R. E., 125 quasiconvex, 188

Rao, M. R., 209 rate of convergence, 105, 138 Rectangular region partitioning, 77, 78 regeneration point, 171 regeneration points, 193 region partitioning, 45, 77-79, 92 reorder point, 181 Rhee, W. T., 41, 89, 105 Rinnooy Kan, A. H. G., 70, 75, 77 risk pooling, 220 Robeson, J. E, 256 Rosenblatt, M., 151 Rosenkrantz, D. J., 24, 28 Rosling, K., 179 Ross, S., 193 Rotation Cycle Policies, 151 Rothblum, U., 151 Round~R., 149, 158, 159,222 route first -cluster second, 83 Russell, R. A., 83

Sahni, S., 22 savings, 82 Savings Algorithm, 82, 242 Scarf, H. E., 179, 183 School Bus Routing and Scheduling,

239-245 Schrage, L., 179, 195 Schwarz, L. B., 158 seed customers, 84, 104, 116 Seed-Insertion Heuristic, 119 service level, 255 set-partitioning, 52, 125-138 Shmoys, D., 61 shortcut, 24 Silver, E. A., 152, 176, 192 Silver-Meal Heuristic, 167, 176, 177 Simchi-Levi, D., 6,17,62,73,81,84,87,88,

102,104,107,133,222 Singh, H., 225 Single-Warehouse Multi-Retailer Model,

158-162 Single-Source Capacitated Facility Location

Problem, 208-211 Sliced interval partitioning heuristic, 39 Sliced Region Partitioning Heuristic, 10 1 Sobel, M. J., 195 Solomon, M. M., 107, 119 spanning tree, 23 splittable demands, 70 Staggering Problem, 151 Stalk, G., 220, 233 Star-Tours Heuristic, 119 stationary, 158 Stationary Order Sizes and Intervals, 152 Steele, J. M., 38, 44, 49 Steiglitz, K., 23, 32, 33 Stewart, W. R., 31 Stout, W. E, 41 subadditive processes, 38, 95 subgradient optimization, 56, 205, 215 subtour elimination constraints, 59 Sweep Algorithm, 83, 84, 94 Swersey, A. J., 243 system inventory, 159

Talagrand, M., 41 Taylor, H. M., 41 Thomas, L. C., 151 Thomas, W. H., 242 time window, 107 transportation rates, 258 Traveling Salesman Problem, 22-32, 43-48,

57-64

triangle inequality, 23 Two-Phase Method, 84 Tzur, M., 167

Unequal-Weight Iterated Tour Partitioning, 85 unimodal,188 unsplit demands, 81

Van Ryzin, G., 107 Vehicle Routing Problem, 69 Vehicle Routing Problem with Distance

Constraints, 122 Vehicle Routing Problem with Time

Windows, 107-122 Veinott, A., 179, 188, 190, 192, 195 Viswanathan, S., 222

Wagelmans, A., 167 Wagner, H. M., 166, 179, 192, 195 Wagner-Whitin Model, 165-170

with capacity constraints, 171-175 multi-item, 175-177

Wal-Mart, 220, 233,258 Wandering Salesman Problem, 33

Weber, A., 204 Whitin, T. M., 151, 156, 166 Williamson, D., 61 Wolsey, L., 61 Wood, D. E, 256, 259 Worst-case analysis, 8

Index 281

and the Bin-Packing Problem, 16--21 and the Traveling Salesman Problem,

22-32 and the ECVRP, 70-75 and the UCVRP, 85-88 and the EWLSP, 153-157 and Direct Shipping, 222-225

Wright, J. w., 82, 242

Yellow, P., 83 Yun, D. K., 151

Zangwill, W.I., 167 Zavi, A., 163 Zero Inventory Ordering Property, 146, 147,

159,166,221 Zheng, Y. S., 179, 192, 195, 196,221 Zipkin, P. H., 179, 195,220 Zoller, K., 151