{"id":"https://openalex.org/W2017860272","doi":"https://doi.org/10.1016/s0305-0548(00)00072-1","title":"A new method for solving capacitated location problems based on a set partitioning approach","display_name":"A new method for solving capacitated location problems based on a set partitioning approach","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2017860272","doi":"https://doi.org/10.1016/s0305-0548(00)00072-1","mag":"2017860272"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(00)00072-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00072-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016325556","display_name":"Roberto Baldacci","orcid":"https://orcid.org/0000-0003-0938-5798"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Roberto Baldacci","raw_affiliation_strings":["Imperial College, Management School 53 Princes's Gate, Exhibition Road, London SW7 2PG, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College, Management School 53 Princes's Gate, Exhibition Road, London SW7 2PG, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067720204","display_name":"Eleni Hadjiconstantinou","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eleni Hadjiconstantinou","raw_affiliation_strings":["Imperial College, Management School 53 Princes's Gate, Exhibition Road, London SW7 2PG, UK"],"affiliations":[{"raw_affiliation_string":"Imperial College, Management School 53 Princes's Gate, Exhibition Road, London SW7 2PG, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035750085","display_name":"Vittorio Maniezzo","orcid":"https://orcid.org/0000-0002-1220-1235"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Vittorio Maniezzo","raw_affiliation_strings":["Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047471933","display_name":"Aristide Mingozzi","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Aristide Mingozzi","raw_affiliation_strings":["Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047471933"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":6.6604,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9633656,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"4","first_page":"365","last_page":"386"},"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.9998000264167786,"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.9998000264167786,"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.9911999702453613,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/facility-location-problem","display_name":"Facility location problem","score":0.724248468875885},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6695401668548584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6678467988967896},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6210975050926208},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6005706787109375},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5369322896003723},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5264946818351746},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5044218301773071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4918982982635498},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4632400870323181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42889273166656494},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.418739378452301},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3601760268211365},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3482000231742859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09211543202400208}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.724248468875885},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6695401668548584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6678467988967896},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6210975050926208},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6005706787109375},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5369322896003723},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5264946818351746},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5044218301773071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4918982982635498},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4632400870323181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42889273166656494},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.418739378452301},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3601760268211365},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3482000231742859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09211543202400208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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":1,"locations":[{"id":"doi:10.1016/s0305-0548(00)00072-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(00)00072-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W659318692","https://openalex.org/W1566418757","https://openalex.org/W1566858220","https://openalex.org/W1978554753","https://openalex.org/W1981372308","https://openalex.org/W2003633968","https://openalex.org/W2010656511","https://openalex.org/W2011039300","https://openalex.org/W2017330843","https://openalex.org/W2030792421","https://openalex.org/W2069512047","https://openalex.org/W2070759324","https://openalex.org/W2077510448","https://openalex.org/W2102333775","https://openalex.org/W2139869884","https://openalex.org/W2149913958","https://openalex.org/W2155742317","https://openalex.org/W2162372265","https://openalex.org/W2162453140","https://openalex.org/W2170833051","https://openalex.org/W2606195968","https://openalex.org/W3123786719","https://openalex.org/W4285719527","https://openalex.org/W6622118684","https://openalex.org/W6683684454"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W3143387519","https://openalex.org/W2113943781","https://openalex.org/W134055995","https://openalex.org/W276709744","https://openalex.org/W2028549267","https://openalex.org/W2009796757","https://openalex.org/W2468851130","https://openalex.org/W2157424698","https://openalex.org/W4302819359"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}