{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:42:17Z","timestamp":1761896537254,"version":"build-2065373602"},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s13675-017-0084-4","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T12:31:49Z","timestamp":1491395509000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["An improved cut-and-solve algorithm for the single-source capacitated facility location problem"],"prefix":"10.1016","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8989-6015","authenticated-orcid":false,"given":"SuneLauth","family":"Gadegaard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4543-8316","authenticated-orcid":false,"given":"Andreas","family":"Klose","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4802-3071","authenticated-orcid":false,"given":"LarsRelund","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1007\/s13675-017-0084-4_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","article-title":"A multi-exchange heuristic for the single-source capacitated facility location problem","volume":"50","author":"Ahuja","year":"2004","journal-title":"Manag Sci"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR2","first-page":"21","article-title":"A computational study of dicut reformulation for the single source capacitated facility location problem","volume":"9","author":"Avella","year":"2011","journal-title":"Stud Inf Univ"},{"issue":"1","key":"10.1007\/s13675-017-0084-4_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","article-title":"Facets of the knapsack polytope from minimal covers","volume":"34","author":"Balas","year":"1978","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"10.1007\/s13675-017-0084-4_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic Lagrangean algorithm for the capacitated plant location problem","volume":"15","author":"Barcel\u00f3","year":"1984","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13675-017-0084-4_CR5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(91)90091-9","article-title":"Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem","volume":"53","author":"Barcel\u00f3","year":"1991","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-017-0084-4_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01784983","article-title":"Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing","volume":"12","author":"Barcel\u00f3","year":"1990","journal-title":"Oper Res Spektrum"},{"issue":"10","key":"10.1007\/s13675-017-0084-4_CR7","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1287\/mnsc.27.10.1120","article-title":"Inverse optimization: an application to the capacitated plant location problem","volume":"27","author":"Bitran","year":"1981","journal-title":"Manag Sci"},{"issue":"1","key":"10.1007\/s13675-017-0084-4_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10852-007-9074-5","article-title":"A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes","volume":"7","author":"Boccia","year":"2008","journal-title":"J Math Modell Algorithms"},{"issue":"4","key":"10.1007\/s13675-017-0084-4_CR9","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","article-title":"Generating Fenchel cutting planes for Knapsack polyhedra","volume":"3","author":"Boyd","year":"1993","journal-title":"SIAM J Optim"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","article-title":"A branch-and-price algorithm for the capacitated p-median problem","volume":"45","author":"Ceselli","year":"2005","journal-title":"Networks"},{"issue":"6","key":"10.1007\/s13675-017-0084-4_CR11","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","article-title":"Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem","volume":"44","author":"Chen","year":"2008","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"8","key":"10.1007\/s13675-017-0084-4_CR12","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.artint.2006.02.005","article-title":"Cut-and-solve: an iterative search strategy for combinatorial optimization problems","volume":"170","author":"Climer","year":"2006","journal-title":"Artif Intell"},{"issue":"1","key":"10.1007\/s13675-017-0084-4_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-007-0193-1","article-title":"Scatter search for the single source capacitated facility location problem","volume":"157","author":"Contreras","year":"2008","journal-title":"Ann Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR14","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","article-title":"A comparison of heuristics and relaxations for the capacitated plant location problem","volume":"50","author":"Cornuejols","year":"1991","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-017-0084-4_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.ejor.2009.10.027","article-title":"Discretized formulations for capacitated location problems with modular distribution costs","volume":"204","author":"Correia","year":"2010","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-017-0084-4_CR16","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","article-title":"A branch-and-price algorithm for the single source capacitated plant location problem","volume":"53","author":"D\u00edaz","year":"2002","journal-title":"J Oper Res Soc"},{"issue":"1-3","key":"10.1007\/s13675-017-0084-4_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Math Progr"},{"issue":"2","key":"10.1007\/s13675-017-0084-4_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20017","article-title":"A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem","volume":"44","author":"Fischetti","year":"2004","journal-title":"Networks"},{"unstructured":"Gadegaard S, Klose A, Nielsen L (2016) A \u201ccut-and-solve\u201d solver for the single source capacitated facility location problem. GitHub, source code (v1.2.0). https:\/\/github.com\/SuneGadegaard\/SSCFLPsolver","key":"10.1007\/s13675-017-0084-4_CR19"},{"doi-asserted-by":"crossref","unstructured":"Geoffrion A (1974) Lagrangean relaxation for integer programming. In: Approaches to integer programming. Vol.\u00a02 of Mathematical Programming Studies. Springer, Berlin, pp 82\u2013114","key":"10.1007\/s13675-017-0084-4_CR20","DOI":"10.1007\/BFb0120690"},{"issue":"4","key":"10.1007\/s13675-017-0084-4_CR21","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","article-title":"Lifted cover inequalities for 0-1 integer programs: computation","volume":"10","author":"Gu","year":"1998","journal-title":"INFORMS J Comput"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR22","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","article-title":"An exact algorithm for the capacitated facility location problems with single sourcing","volume":"113","author":"Holmberg","year":"1999","journal-title":"Eur J Oper Res"},{"issue":"1-2","key":"10.1007\/s13675-017-0084-4_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","article-title":"Separation algorithms for 0-1 knapsack polytopes","volume":"124","author":"Kaparis","year":"2010","journal-title":"Math Progr"},{"key":"10.1007\/s13675-017-0084-4_CR24","series-title":"Complexity of computer computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1007\/s13675-017-0084-4_CR25","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","article-title":"A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints","volume":"37","author":"Klincewicz","year":"1986","journal-title":"J Oper Res Soc"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR26","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.03.078","article-title":"A branch-and-price algorithm for the capacitated facility location problem","volume":"179","author":"Klose","year":"2007","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR27","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","article-title":"Dynamic programming and strong bounds for the 0-1 knapsack problem","volume":"45","author":"Martello","year":"1999","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-017-0084-4_CR28","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","article-title":"An algorithm for the fixed-charge assigning users to sources problem","volume":"34","author":"Neebe","year":"1983","journal-title":"J Oper Res Soc"},{"year":"1988","author":"Nemhauser","series-title":"Integer and combinatorial optimization","key":"10.1007\/s13675-017-0084-4_CR29"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithms for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-017-0084-4_CR31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0377-2217(98)00045-9","article-title":"A repeated matching heuristic for the single-source capacitated facility location problem","volume":"116","author":"R\u00f6nnqvist","year":"1999","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR32","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","article-title":"A Lagrangian heuristic for the capacitated plant location problem with single source constraints","volume":"66","author":"Sridharan","year":"1993","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02614517","article-title":"On the 0\/1 knapsack polytope","volume":"77","author":"Weismantel","year":"1997","journal-title":"Math Progr"},{"issue":"3","key":"10.1007\/s13675-017-0084-4_CR34","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.ejor.2012.03.047","article-title":"A cut-and-solve based algorithm for the single-source capacitated facility location problem","volume":"221","author":"Yang","year":"2012","journal-title":"Eur J Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0084-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0084-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000939?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000939?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0084-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:45Z","timestamp":1761882405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S2192440621000939"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0084-4","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved cut-and-solve algorithm for the single-source capacitated facility location problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-017-0084-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}