A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
Published Online:1 Aug 2007https://doi.org/10.1287/opre.1060.0374
References
- Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
- Two-echelon distribution systems with vehicle routing costs and central inventories. Oper. Res. (1993) 41(1):37–47Link, Google Scholar
- An optimal policy for a two depot inventory problem with stock transfer. Management Sci. (1997) 43(2):173–183Link, Google Scholar
- Robust optimization—Methodology and applications. Math. Programming (2002) 92(3):453–480Crossref, Google Scholar
- The best of both worlds: A hybrid approach to calculating value at risk. Risk (1998) 11(5):64–67Google Scholar
- Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. (2000) 10(3):697–721Crossref, Google Scholar
- The forward-reserve problem. Proc. 1992 IBM Europe Inst. Optim. Solutions (1994) Oberlech, Austria:43–61Google Scholar
- Synchronized development of production, inventory, and distribution schedules. Transportation Sci. (1999) 33(3):330–340Link, Google Scholar
- Graves S., Rinnooy Kan A., Zipkin P.Logistics of Production and Inventory, Handbooks in Operations Research and Management Science (1993) 4(North-Holland, Amsterdam, The Netherlands) Google Scholar
- The Bootstrap and Edgeworth Expansions (1992) (Springer, New York) Crossref, Google Scholar
- (2005) . ConicBundle 0.1. Fakultät für Mathematik, Technische Universität Chemnitz, Chemnitz, Germany. http://www.tu-chemnitz.de/∼helmberg/conicbundleGoogle Scholar
- A spectral bundle method with bounds. Math. Programming (2002) 93(2):173–194Crossref, Google Scholar
- A case study of joint online truck scheduling and inventory management for multiple warehouses. (2005) . Preprint 2005-3, Fakultät für Mathematik, Technische Universität Chemnitz, Chemnitz, GermanyGoogle Scholar
- Convex Analysis and Minimization Algorithms II. Grundlehren der mathematischen Wissenschaften (1993) 306(Springer, Berlin, Heidelberg, Germany) Google Scholar
- ILOG S. A.ILOG AMPL CPLEX System, Version 9.1, User’s Guide (2005) (Gentilly, Cedex, France) . http://www.ilog.comGoogle Scholar
- Ein dynamisches Mehr-Lager-Modell mit Transportbeziehungen zwischen den Lagern. Math. Operationsforsch. Statist., Ser. Optim. (1982) 13:267–286Crossref, Google Scholar
- Optimal adaptive inventory control for a multi-location model with redistribution. Optimization (1988) 19:525–537Crossref, Google Scholar
- Combinatorial Optimization. Theory and Algorithms, Algorithms and Combinatorics (2002) 212nd ed.(Springer, Berlin, Germany) Google Scholar
- MCF Version 1.2—A network simplex implementation. (2000) (Zuse Institute, Berlin, Germany) . http://www.zib.de/optimization/software/mcfGoogle Scholar
- Linear Optimization and Extensions, Algorithms and Combinatorics (1999) 122nd ed.(Springer, Berlin, Germany) Crossref, Google Scholar
- Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. (1999) 33(4):361–380Link, Google Scholar
- , Groetschel M., Krumke S., Rambau J. Multistage stochastic integer programs: An introduction. Online Optimization of Large Scale Systems (2001) (Springer, Berlin, Germany) 579–598Crossref, Google Scholar
- Combinatorial Optimization. Algorithms and Combinatorics (2003) 24(Springer, Berlin, Germany) Google Scholar
- Stochastic programming with integer variables. Math. Programming (2003) 97(1–2):285–309Crossref, Google Scholar
- Mathematical Statistics. Springer Texts in Statistics (2003) 2nd ed.(Springer-Verlag, New York, Berlin, Heidelberg) Crossref, Google Scholar
- Density Estimation for Statistics and Data Analysis. Monographs on Statistics and Applied Probability (1986) (Chapman and Hall, New York) Crossref, Google Scholar
- Forward-reserve allocation in a warehouse with unit-load replenishments. Eur. J. Oper. Res. (1998) 111:98–113Crossref, Google Scholar
- Convex approximations for complete integer recourse models. Math. Programming (2004) 99(2):297–310Crossref, Google Scholar

