Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

Two-Level Capacitated Discrete Location with Concave Costs

Published Online:3 Jun 2022https://doi.org/10.1287/trsc.2022.1150

References

  • Ahmadi-Javid A, Seyedi P, Syam SS (2017) A survey of healthcare facility location. Comput. Oper. Res. 79:223–263.Crossref, Google Scholar
  • Ahmed S, He Q, Li S, Nemhauser GL (2016) On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. SIAM J. Optim. 26(4):2059–2079.Crossref, Google Scholar
  • Atamtürk A, Küçükyavuz S, Tezel B (2017) Path cover and path pack inequalities for the capacitated fixed-charge network flow problem. SIAM J. Optim. 27(3):1943–1976.Crossref, Google Scholar
  • 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.Crossref, Google Scholar
  • Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Numer. 22:1–131.Crossref, Google Scholar
  • Benson HP (1996) Deterministic algorithms for constrained concave minimization: A unified critical survey. Naval Res. Logist. 43(6):765–795.Crossref, Google Scholar
  • Berman O, Krass D (2019) Stochastic location models with congestion. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science, 2nd ed. (Springer, Cham, Switzerland), 443–486.Crossref, Google Scholar
  • Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: A survey. Survey Oper. Res. Management Sci. 17(2):97–106.Crossref, Google Scholar
  • Castro J, Nasini S (2021) A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks. Eur. J. Oper. Res. 290(3):857–869.Crossref, Google Scholar
  • Cohen MA, Moon S (1991) An integrated plant loading model with economies of scale and scope. Eur. J. Oper. Res. 50(3):266–279.Crossref, Google Scholar
  • Contreras I, Ortiz-Astorquiza C (2019) Hierarchical facility location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science, 2nd ed. (Springer, Cham, Switzerland), 365–389.Crossref, Google Scholar
  • Contreras I, Cordeau JF, Laporte G (2011) The dynamic uncapacitated hub location problem. Transportation Sci. 45(1):18–32.Link, Google Scholar
  • D’Ambrosio C, Lodi A (2013) Mixed integer nonlinear programming tools: An updated practical overview. Ann. Oper. Res. 204(1):301–320.Crossref, Google Scholar
  • Dang C, Sun Y, Wang Y, Yang Y (2011) A deterministic annealing algorithm for the minimum concave cost network flow problem. Neural Networks 24(7):699–708.Crossref, Google Scholar
  • Drezner Z, Hamacher HW (2002) Facility Location: Applications and Theory (Springer Verlag, Berlin).Crossref, Google Scholar
  • Elhedhli S, Merrick R (2012) Green supply chain network design to reduce carbon emissions. Transportation Res. Part D Transportation Environ. 17(5):370–379.Crossref, Google Scholar
  • Falk JE, Soland RM (1969) An algorithm for separable nonconvex programming problems. Management Sci. 15(9):550–569.Link, Google Scholar
  • Farahani RZ, Hekmatfar M, Fahimnia B, Kazemzadeh N (2014) Hierarchical facility location problem: Models, classifications, techniques, and applications. Comput. Industrial Engrg. 68:104–117.Crossref, Google Scholar
  • Fischetti M, Ljubić I, Sinnl M (2016) Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3):557–569.Crossref, Google Scholar
  • Fontes DB (2008) On minimum concave cost network flow problems. Internat. J. Pure Appl. Math. 49(4):517–524.Google Scholar
  • Fontes DB, Hadjiconstantinou E, Christofides N (2006) A branch-and-bound algorithm for concave network flow problems. J. Global Optim. 34(1):127–155.Crossref, Google Scholar
  • Fortz B (2015) Location problems in telecommunications. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science, 2nd ed. (Springer, Cham, Switzerland), 537–554.Google Scholar
  • Guisewite G, Pardalos P (1990a) Algorithms for the uncapacitated single-source minimum concave-cost network flow problem. Oper. Res. 90:703–713.Google Scholar
  • Guisewite GM, Pardalos PM (1990b) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Ann. Oper. Res. 25(1):75–99.Crossref, Google Scholar
  • Hajiaghayi MT, Mahdian M, Mirrokni VS (2003) The facility location problem with general cost functions. Networks 42(1):42–47.Crossref, Google Scholar
  • Harkness J, ReVelle C (2003) Facility location with increasing production costs. Eur. J. Oper. Res. 145(1):1–13.Crossref, Google Scholar
  • He Q, Ahmed S, Nemhauser GL (2015) Minimum concave cost flow over a grid network. Math. Programming 150(1):79–98.Crossref, Google Scholar
  • Horst R, Thoai NV (1998) An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks. Oper. Res. Spektrum 20(1):47–53.Crossref, Google Scholar
  • Kelly DL, Khumawala BM (1982) Capacitated warehouse location with concave costs. J. Oper. Res. Soc. 33(9):817–826.Crossref, Google Scholar
  • Kim D, Pan X, Pardalos PM (2006) An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems. Comput. Econom. 27(2):273–293.Crossref, Google Scholar
  • Kubo M, Kasugai H (1991) A Lagrangean approach to the facility location problem with concave costs. J. Oper. Res. Soc. Japan 34(2):125–136.Google Scholar
  • Lamar BW (1993) An improved branch and bound algorithm for minimum concave cost network flow problems. J. Global Optim. 3(3):261–287.Crossref, Google Scholar
  • Laporte G, Nickel S, da Gama FS (2019) Location Science, 2nd ed. (Springer, Cham, Switzerland).Crossref, Google Scholar
  • Larsson T, Migdalas A, Rönnqvist M (1994) A Lagrangean heuristic for the capacitated concave minimum cost network flow problem. Eur. J. Oper. Res. 78(1):116–129.Crossref, Google Scholar
  • Lee J, Leyffer S (2012) Mixed Integer Nonlinear Programming (Springer, New York).Crossref, Google Scholar
  • Lin JR, Nozick LK, Turnquist MA (2006) Strategic design of distribution systems with economies of scale in transportation. Ann. Oper. Res. 144(1):161–180.Crossref, Google Scholar
  • Liu ML, Sahinidis NV, Shectman JP (1996) Planning of chemical process networks via global concave minimization. Global Optimization in Engineering Design (Springer, Boston), 195–230.Crossref, Google Scholar
  • Lu D, Gzara F, Elhedhli S (2014) Facility location with economies and diseconomies of scale: Models and column generation heuristics. IIE Trans. 46(6):585–600.Crossref, Google Scholar
  • Malik A (2021) Location problems in supply chain design: Concave costs, probabilistic service levels, and omnichannel distribution. PhD thesis, Concordia University, Montreal, Canada.Google Scholar
  • Manousiouthakis VI, Thomas N, Justanieah AM (2011) On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope. J. Optim. Theory Appl. 151(1):121–134.Crossref, Google Scholar
  • Melo M, Nickel S, da Gama FS (2009) Facility location and supply chain management: A review. Eur. J. Oper. Res. 196(2):401–412.Crossref, Google Scholar
  • Ortega F, Wolsey LA (2003) A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3):143–158.Crossref, Google Scholar
  • Ortiz-Astorquiza C, Contreras I, Laporte G (2017) Formulations and approximation algorithms for multilevel uncapacitated facility location. INFORMS J. Comput. 29(4):767–779.Link, Google Scholar
  • Ortiz-Astorquiza C, Contreras I, Laporte G (2018) Multi-level facility location problems. Eur. J. Oper. Res. 267(3):791–805.Crossref, Google Scholar
  • Ortiz-Astorquiza C, Contreras I, Laporte G (2019) An exact algorithm for multi-level uncapacitated facility location. Transportation Sci. 53(4):1085–1106.Link, Google Scholar
  • Ryoo HS, Sahinidis NV (1996) A branch-and-reduce approach to global optimization. J. Global Optim. 8(2):107–138.Crossref, Google Scholar
  • Şahin G, Süral H (2007) A review of hierarchical facility location models. Comput. Oper. Res. 34(8):2310–2331.Crossref, Google Scholar
  • Saif A, Elhedhli S (2016) A Lagrangian heuristic for concave cost facility location problems: The plant location and technology acquisition problem. Optim. Lett. 10(5):1087–1100.Crossref, Google Scholar
  • Salman FS, Yücel E (2015) Emergency facility location under random network damage: Insights from the istanbul case. Comput. Oper. Res. 62:266–281.Crossref, Google Scholar
  • Shen ZJM, Daskin MS (2005) Trade-offs between customer service and cost in integrated supply chain design. Manufacturing Service Oper. Management 7(3):188–207.Link, Google Scholar
  • Shen ZJM, Coullard C, Daskin MS (2003) A joint location-inventory model. Transportation Sci. 37(1):40–55.Link, Google Scholar
  • Soland RM (1974) Optimal facility location with concave costs. Oper. Res. 22(2):373–382.Link, Google Scholar
  • Vidyarthi N, Jayaswal S (2014) Efficient solution of a class of location–allocation problems with stochastic demand and congestion. Comput. Oper. Res. 48:20–30.Crossref, Google Scholar
  • Vidyarthi N, Çelebi E, Elhedhli S, Jewkes E (2007) Integrated production-inventory-distribution system design with risk pooling: Model formulation and heuristic solution. Transportation Sci. 41(3):392–408.Link, Google Scholar
  • Zangwill WI (1968) Minimum concave cost flows in certain networks. Management Sci. 14(7):429–450.Link, Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree