Models and Methods for Merge-in-Transit Operations

References

• Ahuja R. K., Dell'Amico M., Dell'Amico F., Martello S. Flows and paths. Annotated Bibliographies in Combinatorial Optimization (1998) (John Wiley and Sons, New York) 283–309Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Upper Saddle River, NJ) Google Scholar
• Balakrishnan A., Graves S. C. A composite algorithm for a concave-cost network flow problem. Networks (1989) 19:175–202Crossref, Google Scholar
• Balakrishnan A., Magnanti T. L., Mirchandani P., Dell'Amico M., Maffioli F., Martello S. Network design. Annotated Bibliographies in Combinatorial Optimization (1998) (John Wiley and Sons, New York) 311–334Google Scholar
• Balakrishnan A., Magnanti T. L., Wong R. T. A dual-ascent procedure for large-scale uncapacitated network design problems. Oper. Res. (1989) 37:716–740Link, Google Scholar
• Bell G. J., Lamar B. W., Wallace C. A. Capacity improvement, penalties, and the fixed charge transportation problem. (1998) . Working paper, The MITRE Corporation, Bedford, MAGoogle Scholar
• Bramel J., Simchi-Levi D.The Logic of Logictics (1997) (Springer-Verlag, New York) Crossref, Google Scholar
• Chan L., Muriel A., Simchi-Levi D. Supply-chain management: Integrated inventory and transportation. (1997) . Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• Cole M. H., Parthasarathy M. Optimal design of merge-intransit distribution networks. (1998) . Working paper, Mack-Blackwell National Rural Transportation Study Center, University of Arkansas, Fayetteville, ARGoogle Scholar
• Cominetti R., Ortega F. A branch-and-bound method for minimum concave cost network flows based on sensitivity analysis. (1997) . Working paper, Departamento de Ingenieria Matematica, Universidad de Chile, Santiago, ChileGoogle Scholar
• Crainic T. G., Hall R. W. Long-haul freight transportation. Handbook of Transportation Science (1999) (Kluwer, Norwell, MA) 433–491Crossref, Google Scholar
• Crainic T. G., Laporte G. Planning models for freight transportation. Eur. J. Oper. Res. (1997) 97:409–438Crossref, Google Scholar
• Crainic T. G., Frangioni A., Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed-charge network design problems. Discrete Appl. Math. (2001) 112:73–99Crossref, Google Scholar
• Croxton K. L. Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management. (1999) . Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixedinteger programming models for non-convex piecewise linear cost minimization problems. (2000) . Publication CRT-2000-31, Centre de recherche sur les transports, Université de Montréal, Montreal, Quebec, CanadaGoogle Scholar
• Croxton K. L., Gendron B., Magnanti T. L. Variable disaggregation in network flow problems with piecewise linear costs. (2002) . Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Gendron B., Crainic T. G., Frangioni A., Sansò B., Soriano P. Multicommodity capacitated network design. Telecommunications Network Planning (1998) (Kluwer Academic Publishers, Norwell, MA) 1–19Google Scholar
• Holmberg K. Solving the staircase cost facility location problem with decomposition and piecewise linearization. Eur. J. Oper. Res. (1994) 75:41–61Crossref, Google Scholar
• Holmberg K., Ling J. A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. (1997) 97:63–74Crossref, Google Scholar
• ILOG Inc. CPLEX 6.0 Reference Manual (1998) (Incline Village, Nevada) Google Scholar
• Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18:1–55Link, Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (John Wiley and Sons, New York) Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Popken D. An algorithm for the multiattribute, multicommodity flow problems with freight consolidation and inventory costs. Oper. Res. (1994) 42:274–286Link, Google Scholar
• Shapiro J. F., Graves S. C., Rinnooy Kan A. H. G., Zipkin P. H. Large-scale assembly systems. Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory (1993) (Elsevier Science Publishers, Amsterdam, The Netherlands) Google Scholar
• Vidal C. J., Goetschalckx M. Strategic production-distribution models: A critical review with emphasis on global supply chain models. Eur. J. Oper. Res. (1997) 98:1–18Crossref, Google Scholar