Approximation algorithms for general one-warehouse multi-retailer systems

Naval Research Logistics

Volumn 56, Issue 7, 2009, Pages 642-658

  Shen, Zuo Jun Max ^a   Shu, Jia ^b   Simchi Levi, David ^c   Teo, Chung Piaw ^d   Zhang, Jiawei ^e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Southeast University   (China)

^c Massachusetts Institute of Technology   (United States)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^e NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Inventory planning; Network flow

Indexed keywords

ALGORITHMIC PROCEDURE; CONCAVE COST; CONCAVE COST NETWORK FLOWS; COST SAVING; COST STRUCTURE; CROSSDOCKING; DEMAND PLANNING; ECONOMIES OF SCALE; INVENTORY PLANNING; LARGE CLASS; LINEAR PROGRAMMING RELAXATION; LOGISTICAL PLANNING; LOST SALE; MULTICOMMODITY NETWORKS; NETWORK FLOW; OPTIMALITY; PIECE-WISE; PIECEWISE LINEAR; PLANNING PROBLEM; POLYNOMIAL-TIME; STORAGE CHARGES;

COMPETITION; COST FUNCTIONS; COSTS; ECONOMICS; LINEARIZATION; PLANNING; POLYNOMIAL APPROXIMATION; WAREHOUSES;

APPROXIMATION ALGORITHMS;

EID: 70349604128     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20367     Document Type: Article

References (26)

1. B. Awerbuch and Y. Azari, "Buy-at-bulk network design", Proceedings of the 38th Annual Symposium on Foundations of Computer Science, ACM, 1998, pp. 542-547.
2. A. Balakrishanan, T. L. Magnanti, and P. Mirchandani, "Network design", Annotated bibliographies in combinatorial optimization, M. Dell' Amico, F. Maffioli, and S. Martello (Editors), Wiley, New York, 1997, pp. 311-334.
3. F. Barahona, Network design using cut inequalities, SIAM J Optim 6 (1996), 823-837.
4. Y. Bartal, "On approximating arbitrary metrices by tree metrics", Proceedings of the 38th Annual Symposium on Foundations of Computer Science, ACM, 1998, pp. 161-168.
5. D. Bienstock, S. Chopra, and O. Gunluk, Minimum cost capacity installation for multi-commodity network flows, Math Program Series B 81 (1998), 177-199.
6. L. M. A. Chan, A. Muriel, Z. J. Shen, and D. Simchi-Levi, An approximation algorithm for the economic lot sizing model with piece-wise linear cost structures, Oper Res 50 (2002a), 1058-1067.
7. L. M. A. Chan, A. Muriel, Z. J. Shen, D. Simchi-Levi, and C. P. Teo, Effective zero inventory ordering policies for the singlewarehouse multi-retailer problem with piecewise linear cost structures, Management Sci 48 (2002b), 1446-1460.
8. L. M. A. Chan, A. Muriel, and D. Simchi-Levi, Production/distribution planning problems with piece-wise linear and concave cost structures, Unpublished Working Paper, Northwestern University, 1998.
9. L. Y. Chu, V. N. Hsu, and Z.-J. Shen, An economic lot-sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis, Naval Res Log 52 (2005), 536-548.
10. R. R. Erickson, C. L. Monma, and A. F. Veinott Jr., Send-andsplit method for minimum concave cost network flows, Math Oper Res 12 (1987), 634-664.
11. M. Grötschel, L. Lovasz, and A. Schrijver, Geometric algorithms and combinatorial optimization (2nd corrected edition), Springer-Verlag, Berlin, 1993.
12. G. Guisewite and P. M. Pardalos, Minimum concave cost network flow problems: Applications, complexity, and algorithms, Annals Oper Res 25 (1990), 75-100.
13. G. Guisewite and P. M. Pardalos, Algorithms for the singlesource uncapacitated minimum concave cost network flow problem, J Global Optim 1 (1991), 245-265.
14. G. Guisewite and P. M. Pardalos, Global search algorithms for minimum concave cost network flow problems, J Global Optim 1 (1991), 309-330.
15. G. Guisewite and P. M. Pardalos, "Single-source uncapacitated minimum concave cost network flow problem", Operations Research '90, H. E. Bradley (Editor), Pergamon Press, Oxford, England, 1991, pp. 703-713.
16. (Pubitemid 126153019) D. Hochbaum and S.-P. Hong, On the complexity of the production-transportation problem, SIAM J Optim 6 (1996), 250-264.
17. R. Levi, R. Roundy, D. B. Shmoys, and M. Sviridenko, A constant approximation algorithm for the one warehouse multi-retailer problem, 2006 (Submitted for publication).
18. Y. Mansour and D. Peleg, An approximation algorithm for minimum cost network design, Technical Report, Weizmann Institue of Science: Rehovot, 1994.
19. S. Nahmias, Perishable inventory theory: A review, Oper Res 30 (1982), 680-708.
20. G. Nemhauser and L. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
21. F. Salman, J. Cheriyan, R. Ravi, and S. Subramanian, Buyat-bulk network design: Approximating the single-sink edge installation problem, Proceeding of the Symposium on Discrete Algorithms, 1997, pp. 619-628.
22. A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J Combinatorial Theory Ser B 80 (1999), 346-355.
23. Z. J. Shen, C. R. Coullard, and M. S. Daskin, A joint locationinventory model, Transportat Sci 37 (2003), 40-55.
24. (Pubitemid 40320215) J. Shu, C. P. Teo, and Z.-J. Shen, Stochastic transportationinventory network design problem, Oper Res 53 (2005), 48-60.
25. (Pubitemid 24801159) M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Num Math 68 (1994), 149-167.
26. H. Tuy, N. D. Dan, and S. Ghannadan, Strongly polynomial time algorithms for certain concave minimization problems on networks, Oper Res Lett 14 (1993), 99-109.