A new Lagrangian-Benders approach for a concave cost supply chain network design problem

References

• Baumgartner K, Fuetterer A, Thonemann UW. 2012. Supply chain design considering economies of scale and transport frequencies. Eur J Oper Res. 218(3):789–800.
   Web of Science ®Google Scholar
• Benders JF. 1962. Partitioning procedures for solving mixed-variables programming problems. Numer Math. 4(1):238–252.
   Google Scholar
• Benjaafar S, Li Y, Xu D, Elhedhli S. 2008. Demand allocation in systems with multiple inventory locations and multiple demand sources. Manuf Serv Oper Manag. 10(1):43–60.
   Web of Science ®Google Scholar
• Castro J. 2000. A specialized interior-point algorithm for multicommodity network flows. SIAM J Optim. 10(3):852–877.
   Web of Science ®Google Scholar
• Castro J, Nasini S, Saldanha-da-Gama F. 2017. A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math Program. 163(1–2):411–444.
   Web of Science ®Google Scholar
• Daskin MS, Coullard C, Shen ZJM. 2002. An inventory-location model: Formulation, solution algorithm and computational results. Ann Oper Res. 110(1/4):83–106.
   Web of Science ®Google Scholar
• Du Merle O, Villeneuve D, Desrosiers J, Hansen P. 1999. Stabilized column generation. Discrete Math. 194(1–3):229–237.
   Web of Science ®Google Scholar
• Ehrhardt R. 1979. The power approximation for computing (s,S) inventory policies. Manage Sci. 25(8):777–786.
   Web of Science ®Google Scholar
• Elhedhli S, Merrick R. 2012. Green supply chain network design to reduce carbon emissions. Transp Res. Part D: Trans Environ. 17(5):370–379.
   Web of Science ®Google Scholar
• Elhedhli S, Wu H. 2010. A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J Comput. 22(2):282–296.
   Web of Science ®Google Scholar
• Gamrath G, Anderson D, Bestuzheva K, Chen WK, Eifler L, Gasse M, Gemander P, Gleixner A, Gottwald L, Halbig K, et al. 2020. The SCIP Optimization Suite 7.0. Optimization Online. Technical report. Available from: http://www.optimizationonline.org/DBHTML/2020/03/7705.html.
   Google Scholar
• Geoffrion AM. 1972. Generalized benders decomposition. J Optim Theory Appl. 10(4):237–260.
   Google Scholar
• Goyal V, Ravi R. 2013. An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper Res Lett. 41(2):191–196.
   Web of Science ®Google Scholar
• Iglehart DL. 1963. Optimality of (s,s) policies in the infinite horizon dynamic inventory problem. Manage Sci. 9(2):259–267.
   Web of Science ®Google Scholar
• Kelley JE. 1960. The cutting-plane method for solving convex programs. J Soc Ind Appl Math. 8(4):703–712.
   Google Scholar
• Konno H, Gao C, Saitoh I. 1998. Cutting plane/tabu search algorithms for low rank concave quadratic programming problems. J Glob Optim. 13(3):225–240.
   Web of Science ®Google Scholar
• Konno H, Thach PT, Tuy H. 2013. Optimization on low rank nonconvex structures. Computational optimization and Applications. Springer Science+Business Media.
   Google Scholar
• Kuno T, Nagai H. 2008. A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems. Comput Optim Appl. 39(2):219–238.
   Web of Science ®Google Scholar
• Matsui T. 1996. NP-hardness of linear multiplicative programming and related problems. J Glob Optim. 9(2):113–119.
   Web of Science ®Google Scholar
• Melo M, Nickel S, Saldanha-da-Gama F. 2009. Facility location and supply chain management – a review. Eur J Oper Res. 196(2):401–412.
   Web of Science ®Google Scholar
• Montoya A, Vélez-Gallego MC, Villegas JG. 2016. Multi-product capacitated facility location problem with general production and building costs. Netnomics. 17(1):47–70.
   Web of Science ®Google Scholar
• Mubashiru ASS. 2014. Transportation with volume discount: a case study of a logistic operator in ghana. J Transp Lit. 8(2):7–37.
   Google Scholar
• Pardalos PM, Vavasis SA. 1991. Quadratic programming with one negative eigenvalue is np-hard. J Glob Optim. 1(1):15–22.
   Google Scholar
• Porembski M. 2004. Cutting planes for low-rank-like concave minimization problems. Oper Res. 52(6):942–953.
   Web of Science ®Google Scholar
• Saif A, Elhedhli S. 2016a. Cold supply chain design with environmental considerations: a simulation-optimization approach. Eur J Oper Res. 251(1):274–287.
   Web of Science ®Google Scholar
• Saif A, Elhedhli S. 2016b. A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem. Optim Lett. 10(5):1087–1100.
   Web of Science ®Google Scholar
• Simchi-Levi D, Kaminsky P, Simchi-Levi E. 2004. Managing the supply chain: Definitive guide. United States: Tata McGraw-Hill Education.
   Google Scholar
• Snyder LV, Daskin MS, Teo CP. 2007. The stochastic location model with risk pooling. Eur J Oper Res. 179(3):1221–1238.
   Web of Science ®Google Scholar
• Soland RM. 1974. Optimal facility location with concave costs. Oper Res. 22(2):373–382.
   Web of Science ®Google Scholar
• Tsai JF. 2007. An optimization approach for supply chain management models with quantity discount policy. Eur J Oper Res. 177(2):982–994.
   Web of Science ®Google Scholar
• Verter V, Dasci A. 2002. The plant location and flexible technology acquisition problem. Eur J Oper Res. 136(2):366–382.
   Web of Science ®Google Scholar