{"id":"https://openalex.org/W3125642975","doi":"https://doi.org/10.1057/palgrave.jors.2602345","title":"A branch-and-cut algorithm for the capacitated open vehicle routing problem","display_name":"A branch-and-cut algorithm for the capacitated open vehicle routing problem","publication_year":2006,"publication_date":"2006-12-13","ids":{"openalex":"https://openalex.org/W3125642975","doi":"https://doi.org/10.1057/palgrave.jors.2602345","mag":"3125642975"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2602345","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602345","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/9501df00-df4b-11da-b43c-000ea68e967b","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004954937","display_name":"Adam N. Letchford","orcid":"https://orcid.org/0000-0002-3191-5006"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A N Letchford","raw_affiliation_strings":["Lancaster University Lancaster UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lancaster University Lancaster UK","institution_ids":["https://openalex.org/I67415387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055534896","display_name":"Jens Lysgaard","orcid":"https://orcid.org/0000-0001-7835-136X"},"institutions":[{"id":"https://openalex.org/I3129642645","display_name":"Aarhus Business College","ror":"https://ror.org/05pvcyy59","country_code":"DK","type":"education","lineage":["https://openalex.org/I3129642645"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J Lysgaard","raw_affiliation_strings":["Aarhus School of Business Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus School of Business Denmark","institution_ids":["https://openalex.org/I3129642645"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000006313","display_name":"Richard Eglese","orcid":"https://orcid.org/0000-0003-2781-9828"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"R W Eglese","raw_affiliation_strings":["Lancaster University Lancaster UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lancaster University Lancaster UK","institution_ids":["https://openalex.org/I67415387"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004954937"],"corresponding_institution_ids":["https://openalex.org/I67415387"],"apc_list":null,"apc_paid":null,"fwci":7.9999,"has_fulltext":true,"cited_by_count":115,"citation_normalized_percentile":{"value":0.97273944,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"58","issue":"12","first_page":"1642","last_page":"1651"},"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.9977999925613403,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.887405276298523},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6232539415359497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5854094624519348},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5629342794418335},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.545153021812439},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5384893417358398},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49887847900390625},{"id":"https://openalex.org/keywords/purchasing","display_name":"Purchasing","score":0.44695577025413513},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4241305887699127},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.4163099229335785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3344234228134155},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.1127927303314209},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10083997249603271}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.887405276298523},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6232539415359497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5854094624519348},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5629342794418335},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.545153021812439},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5384893417358398},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49887847900390625},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.44695577025413513},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4241305887699127},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.4163099229335785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3344234228134155},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.1127927303314209},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10083997249603271},{"id":"https://openalex.org/C44870925","wikidata":"https://www.wikidata.org/wiki/Q37547","display_name":"Astrophysics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1057/palgrave.jors.2602345","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602345","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:hhb:aarbls:2006-006","is_oa":false,"landing_page_url":null,"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":"preprint"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:58:y:2007:i:12:d:10.1057_palgrave.jors.2602345","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2602345","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:eprints.lancs.ac.uk:44644","is_oa":false,"landing_page_url":"https://eprints.lancs.ac.uk/id/eprint/44644/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"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":"Journal Article"},{"id":"pmh:oai:eprints.lancs.ac.uk:48829","is_oa":false,"landing_page_url":"https://eprints.lancs.ac.uk/id/eprint/48829/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401916","display_name":"Lancaster EPrints (Lancaster University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67415387","host_organization_name":"Lancaster University","host_organization_lineage":["https://openalex.org/I67415387"],"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":"Monograph"},{"id":"pmh:oai:pure.atira.dk:openaire/9501df00-df4b-11da-b43c-000ea68e967b","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9501df00-df4b-11da-b43c-000ea68e967b","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":"Letchford, A N, Lysgaard, J & Eglese, R W 2006 'A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem' Aarhus School of Business, Aarhus.","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"pmh:oai:pure.atira.dk:publications/1fe77ae0-c7df-11db-85b6-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/1fe77ae0-c7df-11db-85b6-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Letchford, A N, Lysgaard, J & Eglese, R W 2007, 'A branch-and-cut algorithm for the capacitated open vehicle routing problem', Journal of the Operational Research Society, vol. 58, no. 12, dec, pp. 1642-1651. https://doi.org/10.1057/palgrave.jors.2602345","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/9501df00-df4b-11da-b43c-000ea68e967b","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9501df00-df4b-11da-b43c-000ea68e967b","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":"Letchford, A N, Lysgaard, J & Eglese, R W 2006 'A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem' Aarhus School of Business, Aarhus.","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3421263000","display_name":null,"funder_award_id":"EP/D072662/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W1963972489","https://openalex.org/W1968384435","https://openalex.org/W1992027359","https://openalex.org/W2017070898","https://openalex.org/W2027678739","https://openalex.org/W2029392610","https://openalex.org/W2038583281","https://openalex.org/W2054515401","https://openalex.org/W2056299576","https://openalex.org/W2062045653","https://openalex.org/W2074533831","https://openalex.org/W2090245401","https://openalex.org/W2090359754","https://openalex.org/W2096796578","https://openalex.org/W2123805664","https://openalex.org/W2163428398","https://openalex.org/W2327315803","https://openalex.org/W2491394537"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W2017649536","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W1990067406","https://openalex.org/W2046300504","https://openalex.org/W2734758384","https://openalex.org/W2953793234","https://openalex.org/W2263874601"],"abstract_inverted_index":{"Abstract":[0],"In":[1,19],"open":[2,31,53,110],"vehicle":[3,37],"routing":[4,38],"problems,":[5],"the":[6,14,24,30,34,52,62,65,92,97,106,115],"vehicles":[7],"are":[8,81],"not":[9],"required":[10],"to":[11,13,73,95,104],"return":[12],"depot":[15],"after":[16],"completing":[17],"service.":[18],"this":[20],"paper,":[21],"we":[22],"present":[23],"first":[25,93],"exact":[26],"optimization":[27],"algorithm":[28,42],"for":[29,83,91],"version":[32],"of":[33,61,99,109,114],"well-known":[35],"capacitated":[36],"problem":[39],"(CVRP).":[40],"The":[41],"is":[43],"based":[44],"on":[45],"branch-and-cut.":[46],"We":[47],"show":[48],"that,":[49],"even":[50],"though":[51],"CVRP":[54],"initially":[55],"looks":[56],"like":[57],"a":[58],"minor":[59],"variation":[60],"standard":[63,85],"CVRP,":[64],"integer":[66],"programming":[67],"formulation":[68],"and":[69,103,111],"cutting":[70],"planes":[71],"need":[72],"be":[74],"modified":[75],"in":[76],"subtle":[77],"ways.":[78],"Computational":[79],"results":[80],"given":[82],"several":[84],"test":[86],"instances,":[87],"which":[88],"enables":[89],"us":[90],"time":[94],"assess":[96],"quality":[98],"existing":[100],"heuristic":[101],"methods,":[102],"compare":[105],"relative":[107],"difficulty":[108],"closed":[112],"versions":[113],"same":[116],"problem.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}