{"id":"https://openalex.org/W2082153300","doi":"https://doi.org/10.1007/s10107-007-0178-5","title":"An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts","display_name":"An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts","publication_year":2007,"publication_date":"2007-07-31","ids":{"openalex":"https://openalex.org/W2082153300","doi":"https://doi.org/10.1007/s10107-007-0178-5","mag":"2082153300"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-007-0178-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-007-0178-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/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":"Roberto Baldacci","raw_affiliation_strings":["DEIS, University of Bologna, Cesena, Italy","DEIS, University of Bologna, Via Venezia 52, 47023, Cesena, Italy","DEIS, Univ. of Bologna Via Venezia, 52 - 47023, Cesena, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DEIS, University of Bologna, Via Venezia 52, 47023, Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DEIS, Univ. of Bologna Via Venezia, 52 - 47023, Cesena, Italy#TAB#","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111519836","display_name":"Nicos Christofides","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":true,"raw_author_name":"Nicos Christofides","raw_affiliation_strings":["Centre for Quantitative Finance, Imperial College, Exhibition Road, London, SW7 2PG, UK","Centre for Quantitative Finance, Imperial College, London, UK","Imperial College, Centre for Quantitative Finance, Exhibition Road, SW7 2PG, London, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantitative Finance, Imperial College, Exhibition Road, London, SW7 2PG, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Centre for Quantitative Finance, Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College, Centre for Quantitative Finance, Exhibition Road, SW7 2PG, London, UK#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"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, Cesena, Italy","Department of Mathematics, University of Bologna, Via Sacchi 3, 47023, Cesena, Italy","University of Bologna, Department of Mathematics, Via Sacchi 3, 47023, Cesena, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bologna, Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"Department of Mathematics, University of Bologna, Via Sacchi 3, 47023, Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"University of Bologna, Department of Mathematics, Via Sacchi 3, 47023, Cesena, Italy#TAB#","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016325556","https://openalex.org/A5047471933","https://openalex.org/A5111519836"],"corresponding_institution_ids":["https://openalex.org/I47508984","https://openalex.org/I9360294"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":28.402,"has_fulltext":false,"cited_by_count":355,"citation_normalized_percentile":{"value":0.99756306,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"115","issue":"2","first_page":"351","last_page":"385"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9690999984741211,"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/heuristics","display_name":"Heuristics","score":0.7308586239814758},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7052363753318787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6835762858390808},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6530637741088867},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.634161114692688},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6301912069320679},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6155304908752441},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5832967758178711},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.577537477016449},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5700268149375916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.569158673286438},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5502179861068726},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5488548278808594},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5481644868850708},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5420350432395935},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5264946818351746},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5100265145301819},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.46611669659614563},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.4573812186717987},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4245035648345947},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.36889225244522095},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.26688238978385925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24573299288749695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19447776675224304}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7308586239814758},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7052363753318787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6835762858390808},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6530637741088867},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.634161114692688},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6301912069320679},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6155304908752441},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5832967758178711},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.577537477016449},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5700268149375916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.569158673286438},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5502179861068726},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5488548278808594},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5481644868850708},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5420350432395935},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5264946818351746},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5100265145301819},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.46611669659614563},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.4573812186717987},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4245035648345947},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36889225244522095},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26688238978385925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24573299288749695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19447776675224304},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-007-0178-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-007-0178-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:cris.unibo.it:11585/52251","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/52251","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W92675384","https://openalex.org/W1487871107","https://openalex.org/W1501435780","https://openalex.org/W1574687152","https://openalex.org/W1582017793","https://openalex.org/W1595882479","https://openalex.org/W1601649239","https://openalex.org/W1663519530","https://openalex.org/W1881524433","https://openalex.org/W1948965050","https://openalex.org/W1969471641","https://openalex.org/W1970355999","https://openalex.org/W1976285162","https://openalex.org/W1982444996","https://openalex.org/W1998205685","https://openalex.org/W2001341021","https://openalex.org/W2011039300","https://openalex.org/W2017070898","https://openalex.org/W2017860272","https://openalex.org/W2029392610","https://openalex.org/W2029681015","https://openalex.org/W2035231387","https://openalex.org/W2038583281","https://openalex.org/W2038700684","https://openalex.org/W2046112356","https://openalex.org/W2070859419","https://openalex.org/W2074533831","https://openalex.org/W2096796578","https://openalex.org/W2101011973","https://openalex.org/W2102333775","https://openalex.org/W2159203019","https://openalex.org/W2162453140","https://openalex.org/W2170021258","https://openalex.org/W2170833051","https://openalex.org/W2999341115","https://openalex.org/W4300129394","https://openalex.org/W6770081585"],"related_works":["https://openalex.org/W2171830873","https://openalex.org/W4230716854","https://openalex.org/W1480704642","https://openalex.org/W1605874004","https://openalex.org/W2802839594","https://openalex.org/W4236278573","https://openalex.org/W2613933337","https://openalex.org/W1942724698","https://openalex.org/W2460697787","https://openalex.org/W2079109527"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":21}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}