{"id":"https://openalex.org/W2551080295","doi":"https://doi.org/10.1007/s10479-016-2360-8","title":"A bi-objective approach to discrete cost-bottleneck location problems","display_name":"A bi-objective approach to discrete cost-bottleneck location problems","publication_year":2016,"publication_date":"2016-11-12","ids":{"openalex":"https://openalex.org/W2551080295","doi":"https://doi.org/10.1007/s10479-016-2360-8","mag":"2551080295"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-016-2360-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-016-2360-8","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"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":"Annals of Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/76e6dc06-e635-48ee-84cf-568e34609d8c","any_repository_has_fulltext":null},"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":"Sune Lauth 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"],"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"],"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":"Lars Relund 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"],"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":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.961,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84769472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"267","issue":"1-2","first_page":"179","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996399998664856,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7964501976966858},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7522556185722351},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6978466510772705},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6309747099876404},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6271677017211914},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4792899489402771},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4613620638847351},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45588693022727966},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4551430344581604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29812726378440857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2660486102104187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18233463168144226}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7964501976966858},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7522556185722351},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6978466510772705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6309747099876404},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6271677017211914},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4792899489402771},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4613620638847351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45588693022727966},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4551430344581604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29812726378440857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2660486102104187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18233463168144226},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10479-016-2360-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-016-2360-8","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"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":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/76e6dc06-e635-48ee-84cf-568e34609d8c","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/76e6dc06-e635-48ee-84cf-568e34609d8c","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gadegaard, S L, Klose, A & Nielsen, L R 2018, 'A bi-objective approach to discrete cost-bottleneck location problems', Annals of Operations Research, vol. 267, no. 1-2, pp. 179-201. https://doi.org/10.1007/s10479-016-2360-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-016-2360-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10479-016-2360-8","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"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/76e6dc06-e635-48ee-84cf-568e34609d8c","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/76e6dc06-e635-48ee-84cf-568e34609d8c","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gadegaard, S L, Klose, A & Nielsen, L R 2018, 'A bi-objective approach to discrete cost-bottleneck location problems', Annals of Operations Research, vol. 267, no. 1-2, pp. 179-201. https://doi.org/10.1007/s10479-016-2360-8","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W171602230","https://openalex.org/W173895910","https://openalex.org/W1578717571","https://openalex.org/W1803694112","https://openalex.org/W1878611151","https://openalex.org/W1971427290","https://openalex.org/W1975348111","https://openalex.org/W1980012026","https://openalex.org/W1980201624","https://openalex.org/W1981943371","https://openalex.org/W1985089902","https://openalex.org/W1988569966","https://openalex.org/W1992428442","https://openalex.org/W1993229675","https://openalex.org/W1996387245","https://openalex.org/W2009575019","https://openalex.org/W2010908358","https://openalex.org/W2014228444","https://openalex.org/W2024133475","https://openalex.org/W2026662237","https://openalex.org/W2049671929","https://openalex.org/W2060514920","https://openalex.org/W2073224500","https://openalex.org/W2080725961","https://openalex.org/W2088352008","https://openalex.org/W2094840011","https://openalex.org/W2094869570","https://openalex.org/W2102750402","https://openalex.org/W2127859636","https://openalex.org/W2143288740","https://openalex.org/W2171290056","https://openalex.org/W2243270611","https://openalex.org/W2273676600","https://openalex.org/W2475121875","https://openalex.org/W2606195968","https://openalex.org/W2615258659","https://openalex.org/W4243557394","https://openalex.org/W4302557773","https://openalex.org/W6638329590"],"related_works":["https://openalex.org/W2595172197","https://openalex.org/W1993634787","https://openalex.org/W2084856301","https://openalex.org/W2127970246","https://openalex.org/W3125614403","https://openalex.org/W2885125400","https://openalex.org/W2964314221","https://openalex.org/W2083833523","https://openalex.org/W2057791178","https://openalex.org/W2269982198"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"a":[3,12,16,25,85,98],"family":[4],"of":[5,28,40,49,68,75,116],"bi-objective":[6,26,36],"discrete":[7],"facility":[8,37,77,117],"location":[9,38,118],"problems":[10,39],"with":[11],"cost":[13],"objective":[14],"and":[15,71,96,134],"bottleneck":[17],"objective.":[18],"A":[19],"special":[20],"case":[21],"is,":[22],"for":[23],"instance,":[24],"version":[27],"the":[29,66,73,82,103,128,136],"(vertex)":[30],"p-centdian":[31],"problem.":[32],"We":[33,107],"show":[34],"that":[35,55,91],"this":[41],"type":[42],"can":[43],"be":[44],"solved":[45],"efficiently":[46],"by":[47],"means":[48],"an":[50],"$$\\varepsilon":[51,87,130],"$$":[52,88,131],"-constraint":[53],"method":[54,90,100,133],"solves":[56],"at":[57],"most":[58],"$$(n-1)\\cdot":[59],"m$$":[60],"minisum":[61],"problems,":[62],"where":[63],"n":[64],"is":[65],"number":[67,74],"customer":[69],"points":[70],"m":[72],"potential":[76],"sites.":[78],"Additionally,":[79],"we":[80],"compare":[81],"approach":[83],"to":[84,97,126,135],"lexicographic":[86,129],"-constrained":[89,132],"only":[92],"returns":[93],"efficient":[94],"solutions":[95],"two-phase":[99],"relying":[101],"on":[102],"perpendicular":[104],"search":[105],"method.":[106,139],"report":[108],"extensive":[109],"computational":[110],"results":[111],"obtained":[112],"from":[113],"several":[114],"classes":[115],"problems.":[119],"The":[120],"proposed":[121],"algorithm":[122],"compares":[123],"very":[124],"favorably":[125],"both":[127],"two":[137],"phase":[138]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2025-10-10T00:00:00"}