Decomposition‐based approximation algorithms for the one‐warehouse multi‐retailer problem with concave batch order costs
暂无分享,去创建一个
[1] Jean-Philippe Gayon,et al. Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales , 2016, Eur. J. Oper. Res..
[2] Marek Chrobak,et al. Better Approximation Bounds for the Joint Replenishment Problem , 2014, SODA.
[3] Arnold Neumaier,et al. OSGA: a fast subgradient algorithm with optimal complexity , 2014, Mathematical Programming.
[4] Viswanath Nagarajan,et al. Approximation algorithms for inventory problems with submodular or routing costs , 2015, Mathematical Programming.
[5] Thomas L. Magnanti,et al. A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..
[6] Lap Mui Ann Chan,et al. Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures , 2002, Manag. Sci..
[7] Felix Hueber,et al. Production And Operations Analysis , 2016 .
[8] Alejandro Toriello,et al. Evaluation of Transportation Practices in the California Cut Flower Industry , 2013, Interfaces.
[9] Christophe Rapine,et al. Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost , 2012, Oper. Res. Lett..
[10] Michal Tzur,et al. Algorithms for the multi-item multi-vehicles dynamic lot sizing problem , 2006 .
[11] Laurence A. Wolsey,et al. Multi-item lot-sizing with joint set-up costs , 2009, Math. Program..
[12] Luca Bertazzi,et al. Polynomial cases of the economic lot sizing problem with cost discounts , 2014, Eur. J. Oper. Res..
[13] David B. Shmoys,et al. The submodular joint replenishment problem , 2015, Math. Program..
[14] Michal Tzur,et al. Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach , 2005, Transp. Sci..
[15] Jean-Philippe Gayon,et al. A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem , 2011, SODA '11.
[16] Jean-Philippe Gayon,et al. Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints , 2017, Math. Oper. Res..
[17] David B. Shmoys,et al. A constant approximation algorithm for the one-warehouse multi-retailer problem , 2005, SODA '05.
[18] Hande Yaman,et al. Lot Sizing with Piecewise Concave Production Costs , 2014, INFORMS J. Comput..
[19] David Simchi-Levi,et al. Approximation algorithms for general one‐warehouse multi‐retailer systems , 2009 .
[20] S. Lippman. Optimal inventory policy with multiple set-up costs , 1968 .
[21] Weihong Hu,et al. Modeling and solution of some multi-period supply chain optimization problems , 2016 .
[22] E. Arkin,et al. Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .
[23] Gautier Stauffer. Using the economical order quantity formula for inventory control in one‐warehouse multiretailer systems , 2012 .
[24] Alok Aggarwal,et al. Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..
[25] Jean-Philippe Gayon,et al. A simple and fast 2-approximation algorithm for the one-warehouse multi-retailer problem , 2015 .
[26] M. Dessouky,et al. Consolidation strategies for the delivery of perishable products , 2014 .
[27] Yue Jin,et al. Single‐warehouse multi‐retailer inventory systems with full truckload shipments , 2009 .
[28] Nelson A. Uhan,et al. Cost-Sharing Mechanism Design for Freight Consolidation among Small Suppliers , 2016 .
[29] Nelson A. Uhan,et al. Moulin mechanism design for freight consolidation , 2018, Transportation Research Part B: Methodological.