{"id":"https://openalex.org/W2159203019","doi":"https://doi.org/10.1287/opre.1040.0111","title":"An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation","display_name":"An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation","publication_year":2004,"publication_date":"2004-09-20","ids":{"openalex":"https://openalex.org/W2159203019","doi":"https://doi.org/10.1287/opre.1040.0111","mag":"2159203019"},"language":"en","primary_location":{"id":"doi:10.1287/opre.1040.0111","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.1040.0111","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"R. Baldacci","raw_affiliation_strings":["DISMI, University of Modena and Reggio Emilia, Viale A. Allegri, 15, 42100 Reggio Emilia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DISMI, University of Modena and Reggio Emilia, Viale A. Allegri, 15, 42100 Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"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":"E. Hadjiconstantinou","raw_affiliation_strings":["Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom","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":false,"raw_author_name":"A. Mingozzi","raw_affiliation_strings":["Department of Mathematics, University of Bologna, Via Sacchi 3, 47023 Cesena, Italy"],"raw_orcid":null,"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":3,"corresponding_author_ids":["https://openalex.org/A5016325556"],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":null,"apc_paid":null,"fwci":24.5913,"has_fulltext":false,"cited_by_count":287,"citation_normalized_percentile":{"value":0.99695431,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"52","issue":"5","first_page":"723","last_page":"738"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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.9872999787330627,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8468368053436279},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.7697631120681763},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6799393892288208},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6654307246208191},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6427822113037109},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6389672756195068},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6043580770492554},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5929898023605347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5896810293197632},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.572600245475769},{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.5552336573600769},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5395587682723999},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5393165946006775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4906398355960846},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4845937490463257},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4484791159629822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3869751989841461}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8468368053436279},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7697631120681763},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6799393892288208},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6654307246208191},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6427822113037109},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6389672756195068},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6043580770492554},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5929898023605347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5896810293197632},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.572600245475769},{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.5552336573600769},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5395587682723999},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5393165946006775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4906398355960846},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4845937490463257},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4484791159629822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3869751989841461},{"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1287/opre.1040.0111","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.1040.0111","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:oropre:v:52:y:2004:i:5:p:723-738","is_oa":false,"landing_page_url":"http://doi.org/10.1287/opre.1040.0111","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":"","raw_type":"article"},{"id":"pmh:oai:cris.unibo.it:11585/1847","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/1847","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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W92675384","https://openalex.org/W132615951","https://openalex.org/W1486993561","https://openalex.org/W1487871107","https://openalex.org/W1501435780","https://openalex.org/W1504684182","https://openalex.org/W1513472112","https://openalex.org/W1558547553","https://openalex.org/W1572233287","https://openalex.org/W1582017793","https://openalex.org/W1595882479","https://openalex.org/W1601649239","https://openalex.org/W1606779053","https://openalex.org/W1663519530","https://openalex.org/W1881524433","https://openalex.org/W1971724331","https://openalex.org/W1972755385","https://openalex.org/W1997403587","https://openalex.org/W1998205685","https://openalex.org/W2003071307","https://openalex.org/W2014238461","https://openalex.org/W2017555839","https://openalex.org/W2029392610","https://openalex.org/W2029681015","https://openalex.org/W2033662447","https://openalex.org/W2035231387","https://openalex.org/W2038583281","https://openalex.org/W2040886899","https://openalex.org/W2044280739","https://openalex.org/W2051719340","https://openalex.org/W2054515401","https://openalex.org/W2055942436","https://openalex.org/W2058892401","https://openalex.org/W2059615070","https://openalex.org/W2072789827","https://openalex.org/W2074533831","https://openalex.org/W2076862344","https://openalex.org/W2082260357","https://openalex.org/W2090939957","https://openalex.org/W2097685766","https://openalex.org/W2101011973","https://openalex.org/W2105006450","https://openalex.org/W2108536179","https://openalex.org/W2114844199","https://openalex.org/W2114939271","https://openalex.org/W2137460743","https://openalex.org/W2163428398","https://openalex.org/W2163873159","https://openalex.org/W2242266352","https://openalex.org/W2324108981","https://openalex.org/W2340149117","https://openalex.org/W2571802679","https://openalex.org/W2999341115","https://openalex.org/W4239570968","https://openalex.org/W4252470642","https://openalex.org/W4294358747","https://openalex.org/W4300129394"],"related_works":["https://openalex.org/W1531708257","https://openalex.org/W2109445739","https://openalex.org/W134055995","https://openalex.org/W566167518","https://openalex.org/W2021079478","https://openalex.org/W4210880521","https://openalex.org/W3126345618","https://openalex.org/W2979455991","https://openalex.org/W2105006450","https://openalex.org/W1990925151"],"abstract_inverted_index":{"The":[0],"capacitated":[1],"vehicle":[2,34],"routing":[3],"problem":[4,8],"(CVRP)":[5],"is":[6,21,74,121],"the":[7,48,64,70,90,99,108,115,119,135],"in":[9,80,107],"which":[10,73],"a":[11,18,42,52,59,81,87,128],"set":[12,129],"of":[13,69,102,118,130],"identical":[14],"vehicles":[15],"located":[16],"at":[17],"central":[19],"depot":[20],"to":[22,26,33],"be":[23],"optimally":[24],"routed":[25],"supply":[27],"customers":[28],"with":[29],"known":[30],"demands":[31],"subject":[32],"capacity":[35],"constraints.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40,85],"describe":[41],"new":[43,71,91,111,139],"integer":[44],"programming":[45,66],"formulation":[46,72],"for":[47,114,127,138],"CVRP":[49,104,120],"based":[50],"on":[51],"two-commodity":[53],"network":[54],"flow":[55],"approach.":[56],"We":[57],"present":[58,86],"lower":[60,92,95],"bound":[61,93],"derived":[62,97,133],"from":[63,98,134],"linear":[65],"(LP)":[67],"relaxation":[68],"improved":[75],"by":[76],"adding":[77],"valid":[78],"inequalities":[79],"cutting-plane":[82],"fashion.":[83],"Moreover,":[84],"comparison":[88],"between":[89],"and":[94,137],"bounds":[96],"LP":[100],"relaxations":[101],"different":[103],"formulations":[105],"proposed":[106],"literature.":[109],"A":[110],"branch-and-cut":[112],"algorithm":[113],"optimal":[116],"solution":[117],"described.":[122],"Computational":[123],"results":[124],"are":[125],"reported":[126],"test":[131],"problems":[132],"literature":[136],"randomly":[140],"generated":[141],"problems.":[142]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":14}],"updated_date":"2026-05-01T08:36:08.643496","created_date":"2025-10-10T00:00:00"}