{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T03:33:36Z","timestamp":1773545616010,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T00:00:00Z","timestamp":1445904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10287-015-0244-z","type":"journal-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T11:06:48Z","timestamp":1445944008000},"page":"317-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An improved Lagrangian relaxation and dual ascent approach to facility location problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Kurt","family":"J\u00f6rnsten","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4543-8316","authenticated-orcid":false,"given":"Andreas","family":"Klose","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,27]]},"reference":[{"key":"244_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.13.1.1","volume":"13","author":"S Ahn","year":"1988","unstructured":"Ahn S, Cooper C, Cornuejols G, Frieze AM (1988) Probabilistic analysis of a relaxation for the $$k$$ k -median problem. Math Oper Res 13:1\u201331","journal-title":"Math Oper Res"},{"key":"244_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10589-007-9125-x","volume":"43","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M (2009) A cutting plane algorithm for the capacitated facility location problem. Comput Optim Appl 43:39\u201365","journal-title":"Comput Optim Appl"},{"key":"244_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P Avella","year":"2007","unstructured":"Avella P, Sassano A, Vasilev I (2007) Computational study of large-scale $$p$$ p -median problems. Math Program 109:89\u2013114","journal-title":"Math Program"},{"key":"244_CR4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","volume":"15","author":"P Avella","year":"2009","unstructured":"Avella P, Boccia M, Sforza A, Vasil\u2019ev I (2009) An effective heuristic for large-scale capacitated facility location problems. J Heuristics 15:597\u2013615","journal-title":"J Heuristics"},{"key":"244_CR5","unstructured":"Babonneau F, Beltran C, Haurie A, Tadonki C, Vial JP (2004) Proximal-ACCPM: a versatile oracle based optimization method. Optimization (online). http:\/\/www.optimization-online.org\/DB_HTML\/2004\/10\/986.html"},{"key":"244_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87:385\u2013399","journal-title":"Math Program"},{"key":"244_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.disopt.2003.03.001","volume":"2","author":"F Barahona","year":"2005","unstructured":"Barahona F, Chudak F (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2:35\u201350","journal-title":"Discrete Optim"},{"key":"244_CR8","doi-asserted-by":"crossref","unstructured":"Belik I, J\u00f6rnsten K (2014) A new semi-Lagrangean relaxation for the $$k$$ k -cardinality assignment problem. Discussion Paper FOR 1 2014, Department of Business and Management Science, Norwegian School of Economics, Bergen, Norway. http:\/\/ssrn.com\/abstract=2380024","DOI":"10.2139\/ssrn.2380024"},{"key":"244_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-006-6513-6","volume":"35","author":"C Beltran","year":"2006","unstructured":"Beltran C, Tadonki C, Vial JP (2006) Solving the $$p$$ p -median problem with a semi-Lagrangian relaxation. Comput Optim Appl 35:239\u2013260","journal-title":"Comput Optim Appl"},{"key":"244_CR10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10589-010-9338-2","volume":"51","author":"C Beltran-Royo","year":"2012","unstructured":"Beltran-Royo C, Vial JP, Alonso-Ayuso A (2012) Semi-Lagrangian relaxation applied to the uncapacitated facility location problem. Comput Optim Appl 51:387\u2013409","journal-title":"Comput Optim Appl"},{"key":"244_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O Bilde","year":"1977","unstructured":"Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 1:79\u201397","journal-title":"Ann Discrete Math"},{"key":"244_CR12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N Christofides","year":"1982","unstructured":"Christofides N, Beasley JE (1982) A tree search algorithm for the $$p$$ p -median problem. Eur J Oper Res 10:196\u2013204","journal-title":"Eur J Oper Res"},{"key":"244_CR13","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag Sci 23:789\u2013810","journal-title":"Manag Sci"},{"key":"244_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/0601030","volume":"1","author":"G Cornuejols","year":"1980","unstructured":"Cornuejols G, Nemhauser GL, Wolsey LA (1980) A canonical representation of simple plant location problems and its applications. SIAM J Algebra Discret Methods 1:261\u2013272","journal-title":"SIAM J Algebra Discret Methods"},{"key":"244_CR15","first-page":"119","volume-title":"Discrete location theory","author":"G Cornuejols","year":"1990","unstructured":"Cornuejols G, Fisher ML, Nemhauser GL (1990) The uncapacitated facility location problem. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 119\u2013171"},{"key":"244_CR16","unstructured":"Dos Santos Eleuterio VL (2009) Finding approximate solutions to large linear programs. Dissertation ETH No 18188, ETH Z\u00fcrich"},{"key":"244_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10878-008-9162-0","volume":"19","author":"S Elloumi","year":"2008","unstructured":"Elloumi S (2008) A tighter formulation for the $$p$$ p -median problem. J Comb Optim 19:69\u201383","journal-title":"J Comb Optim"},{"key":"244_CR18","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992\u20131009","journal-title":"Oper Res"},{"key":"244_CR19","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D Ghosh","year":"2003","unstructured":"Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res 150:150\u2013162","journal-title":"Eur J Oper Res"},{"key":"244_CR20","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"JL Goffin","year":"2002","unstructured":"Goffin JL, Vial JP (2002) Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method. Optim Method Softw 17:805\u2013867","journal-title":"Optim Method Softw"},{"key":"244_CR21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"JL Goffin","year":"1992","unstructured":"Goffin JL, Haurie A, Vial JP (1992) Decomposition and nondifferentiable optimization with the projective algorithm. Manag Sci 38:284\u2013302","journal-title":"Manag Sci"},{"key":"244_CR22","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s10732-012-9212-8","volume":"18","author":"G Guastaroba","year":"2009","unstructured":"Guastaroba G, Speranza MG (2009) Kernel search for the capacitated facility location problem. J Heuristics 18:877\u2013917","journal-title":"J Heuristics"},{"key":"244_CR23","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","volume":"20","author":"P Hanjoul","year":"1985","unstructured":"Hanjoul P, Peeters D (1985) A comparison of two dual-based procedures for solving the $$p$$ p -median problem. Eur J Oper Res 20:387\u2013396","journal-title":"Eur J Oper Res"},{"key":"244_CR24","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1287\/ijoc.1060.0196","volume":"19","author":"P Hansen","year":"2007","unstructured":"Hansen P, Brimberg J, Mladenovi\u0107 DUN (2007) Primal-dual variable neighborhood search for the simple plant-location problem. INFORMS J Comput 19:552\u2013564","journal-title":"INFORMS J Comput"},{"key":"244_CR25","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10479-008-0343-0","volume":"164","author":"J Janacek","year":"2008","unstructured":"Janacek J, Buzna L (2008) An acceleration of Erlenkotter\u2013Koerkel\u2019s algorithms for the uncapacitated facility location problem. Ann Oper Res 164:97\u2013109","journal-title":"Ann Oper Res"},{"key":"244_CR26","doi-asserted-by":"crossref","first-page":"B718","DOI":"10.1287\/mnsc.18.12.B718","volume":"18","author":"BM Khumawala","year":"1972","unstructured":"Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manag Sci 18:B718\u2013B731","journal-title":"Manag Sci"},{"key":"244_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/j.1475-3995.1998.tb00111.x","volume":"5","author":"A Klose","year":"1998","unstructured":"Klose A (1998) A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Int Trans Oper Res 5:155\u2013168","journal-title":"Int Trans Oper Res"},{"key":"244_CR28","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","volume":"39","author":"M K\u00f6rkel","year":"1989","unstructured":"K\u00f6rkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39:157\u2013173","journal-title":"Eur J Oper Res"},{"key":"244_CR29","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J Krarup","year":"1983","unstructured":"Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper Res 12:36\u201381","journal-title":"Eur J Oper Res"},{"key":"244_CR30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1051\/ro:2001107","volume":"35","author":"J Kratica","year":"2001","unstructured":"Kratica J, Tosic D, Filipovic V, Ljubic I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO-Oper Res 35:127\u2013142","journal-title":"RAIRO-Oper Res"},{"key":"244_CR31","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.cor.2011.06.014","volume":"39","author":"AN Letchford","year":"2012","unstructured":"Letchford AN, Miller SJ (2012) Fast bounding procedures for large instances of the simple plant location problem. Comput Oper Res 39:985\u2013990","journal-title":"Comput Oper Res"},{"key":"244_CR32","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2013.10.020","volume":"234","author":"AN Letchford","year":"2014","unstructured":"Letchford AN, Miller SJ (2014) An aggressive reduction scheme for the simple plant location problem. Eur J Oper Res 234:674\u2013682","journal-title":"Eur J Oper Res"},{"key":"244_CR33","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/ijoc.1110.0460","volume":"24","author":"R Mansini","year":"2012","unstructured":"Mansini R, Speranza MG (2012) Coral: an exact algorithm for the multidimensional Knapsack problem. INFORMS J Comput 24:399\u2013415","journal-title":"INFORMS J Comput"},{"key":"244_CR34","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s13160-014-0149-1","volume":"31","author":"E Monabbati","year":"2014","unstructured":"Monabbati E (2014) An application of a Lagrangian-type relaxation for the uncapacitated facility location problem. Jpn J Ind Appl Math 31:483\u2013499","journal-title":"Jpn J Ind Appl Math"},{"key":"244_CR35","first-page":"279","volume":"11","author":"GL Nemhauser","year":"1981","unstructured":"Nemhauser GL, Wolsey LA (1981) Maximizing submodular set functions: formulations and analysis of algorithms. Ann Discrete Math 11:279\u2013301","journal-title":"Ann Discrete Math"},{"key":"244_CR36","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov Y (2009) Primal-dual subgradient methods for convex problems. Math Program 120:221\u2013259","journal-title":"Math Program"},{"key":"244_CR37","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger D (1997) A minimal algorithm for the 0\u20131 Knapsack problem. Oper Res 45:758\u2013767","journal-title":"Oper Res"},{"key":"244_CR38","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s12532-014-0065-z","volume":"6","author":"M Posta","year":"2014","unstructured":"Posta M, Ferland JA, Michelon P (2014) An exact cooperative method for the uncapacitated facility location problem. Math Program Comput 6:199\u2013231","journal-title":"Math Program Comput"},{"key":"244_CR39","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"MG Resende","year":"2006","unstructured":"Resende MG, Werneck RF (2006) A hybrid multistart heuristic for the uncapacitated facility location problem. Eur J Oper Res 174:54\u201368","journal-title":"Eur J Oper Res"},{"key":"244_CR40","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4419-7572-0_2","volume-title":"Foundations of locational analysis","author":"V Verter","year":"2011","unstructured":"Verter V (2011) Uncapacitated and capacitated facility location problem. In: Eiselt HA, Marionov V (eds) Foundations of locational analysis. Springer, Berlin, pp 25\u201337"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0244-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-015-0244-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-015-0244-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T21:07:11Z","timestamp":1567285631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-015-0244-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,27]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["244"],"URL":"https:\/\/doi.org\/10.1007\/s10287-015-0244-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,27]]}}}