{"id":"https://openalex.org/W2604493856","doi":"https://doi.org/10.1007/s13675-017-0084-4","title":"An improved cut-and-solve algorithm for the single-source capacitated facility location problem","display_name":"An improved cut-and-solve algorithm for the single-source capacitated facility location problem","publication_year":2017,"publication_date":"2017-04-05","ids":{"openalex":"https://openalex.org/W2604493856","doi":"https://doi.org/10.1007/s13675-017-0084-4","mag":"2604493856"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-017-0084-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-017-0084-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-017-0084-4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011329804","display_name":"Sune Lauth Gadegaard","orcid":"https://orcid.org/0000-0001-8989-6015"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"SuneLauth Gadegaard","raw_affiliation_strings":["Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, Fuglesangs All\u00e9 4, 8210, Aarhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-8989-6015","affiliations":[{"raw_affiliation_string":"Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, Fuglesangs All\u00e9 4, 8210, Aarhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088092832","display_name":"Andreas Klose","orcid":"https://orcid.org/0000-0003-4543-8316"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Klose","raw_affiliation_strings":["Department of Mathematics, Science and Technology, Aarhus University, Ny Munkegade 118, 8000, Aarhus C, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-4543-8316","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Science and Technology, Aarhus University, Ny Munkegade 118, 8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031737991","display_name":"Lars Relund Nielsen","orcid":"https://orcid.org/0000-0002-4802-3071"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"LarsRelund Nielsen","raw_affiliation_strings":["Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, Fuglesangs All\u00e9 4, 8210, Aarhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-4802-3071","affiliations":[{"raw_affiliation_string":"Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, Fuglesangs All\u00e9 4, 8210, Aarhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011329804"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":3.6896,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93143767,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":"1","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.597277820110321},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5863097906112671},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5625872015953064},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5618795156478882},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5467960238456726},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5313979387283325},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.47300273180007935},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.46221867203712463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4554881155490875},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4552000164985657},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44221562147140503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3958788514137268}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.597277820110321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5863097906112671},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5625872015953064},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5618795156478882},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5467960238456726},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5313979387283325},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.47300273180007935},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.46221867203712463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4554881155490875},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4552000164985657},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44221562147140503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3958788514137268},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s13675-017-0084-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-017-0084-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:eurjco:v:6:y:2018:i:1:d:10.1007_s13675-017-0084-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-017-0084-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:1ebdfb8a351d4dc493c6ea3773674fd7","is_oa":true,"landing_page_url":"https://doaj.org/article/1ebdfb8a351d4dc493c6ea3773674fd7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 6, Iss 1, Pp 1-27 (2018)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire/181a52da-c9cb-4bd1-a6db-328f9868cee3","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/181a52da-c9cb-4bd1-a6db-328f9868cee3","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gadegaard, S L, Klose, A & Nielsen, L R 2018, 'An improved cut-and-solve algorithm for the single-source capacitated facility location problem', EURO Journal on Computational Optimization, vol. 6, no. 1, pp. 1-27. https://doi.org/10.1007/s13675-017-0084-4","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/181a52da-c9cb-4bd1-a6db-328f9868cee3","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85042286914&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gadegaard, S L, Klose, A & Nielsen, L R 2018, 'An improved cut-and-solve algorithm for the single-source capacitated facility location problem', EURO Journal on Computational Optimization, vol. 6, no. 1, pp. 1-27. https://doi.org/10.1007/s13675-017-0084-4","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s13675-017-0084-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-017-0084-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1968143987","https://openalex.org/W1979004882","https://openalex.org/W1981943371","https://openalex.org/W1982373167","https://openalex.org/W1983006026","https://openalex.org/W1985089902","https://openalex.org/W1988969546","https://openalex.org/W1991247020","https://openalex.org/W1993011104","https://openalex.org/W1993229675","https://openalex.org/W2001576444","https://openalex.org/W2003537141","https://openalex.org/W2007393558","https://openalex.org/W2010136497","https://openalex.org/W2018596236","https://openalex.org/W2022398556","https://openalex.org/W2023907835","https://openalex.org/W2031302513","https://openalex.org/W2041989601","https://openalex.org/W2052210854","https://openalex.org/W2066356146","https://openalex.org/W2067093916","https://openalex.org/W2069512047","https://openalex.org/W2070759324","https://openalex.org/W2103698736","https://openalex.org/W2117522563","https://openalex.org/W2145145778","https://openalex.org/W2156293131","https://openalex.org/W2163936975","https://openalex.org/W2166420930","https://openalex.org/W2327321413","https://openalex.org/W2397730217","https://openalex.org/W2401610261","https://openalex.org/W2505968561","https://openalex.org/W2595833503","https://openalex.org/W4232585008","https://openalex.org/W4242130683","https://openalex.org/W4243368091","https://openalex.org/W6644040475","https://openalex.org/W6712702859"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W2046300504","https://openalex.org/W2009796757","https://openalex.org/W2084616826","https://openalex.org/W2110818895","https://openalex.org/W4223947110","https://openalex.org/W2008600006","https://openalex.org/W2158503982","https://openalex.org/W1593376002","https://openalex.org/W4398217958"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"an":[5,51],"improved":[6],"cut-and-solve":[7,67],"algorithm":[8,17,33,83],"for":[9],"the":[10,26,62,66,71,81],"single-source":[11],"capacitated":[12],"facility":[13],"location":[14],"problem.":[15],"The":[16,22,40],"consists":[18],"of":[19],"three":[20],"phases.":[21],"first":[23],"phase":[24,42,64],"strengthens":[25],"integer":[27],"program":[28],"by":[29],"a":[30,36,44],"cutting":[31],"plane":[32],"to":[34,49,69,91],"obtain":[35],"tight":[37],"lower":[38],"bound.":[39],"second":[41],"uses":[43,65],"two-level":[45],"local":[46],"branching":[47],"heuristic":[48],"find":[50],"upper":[52],"bound,":[53],"and":[54],"if":[55],"optimality":[56,72],"has":[57],"not":[58],"yet":[59],"been":[60],"established,":[61],"third":[63],"framework":[68],"close":[70],"gap.":[73],"Extensive":[74],"computational":[75],"results":[76],"are":[77],"reported,":[78],"showing":[79],"that":[80],"proposed":[82],"runs":[84],"10\u201380":[85],"times":[86],"faster":[87],"on":[88],"average":[89],"compared":[90],"state-of-the-art":[92],"problem-specific":[93],"algorithms.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}