{"id":"https://openalex.org/W2002356593","doi":"https://doi.org/10.1137/s0097539701392056","title":"Algorithms for Capacitated Vehicle Routing","display_name":"Algorithms for Capacitated Vehicle Routing","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2002356593","doi":"https://doi.org/10.1137/s0097539701392056","mag":"2002356593"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701392056","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701392056","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moses Charikar","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":3.4819,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.90922135,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"665","last_page":"682"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.996999979019165,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8147006630897522},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7174016237258911},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6053504943847656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5848152041435242},{"id":"https://openalex.org/keywords/subject","display_name":"Subject (documents)","score":0.5064805746078491},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3451361060142517},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.34410586953163147},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3243252635002136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21967029571533203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21687346696853638},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21458756923675537},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.16986849904060364}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8147006630897522},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7174016237258911},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6053504943847656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5848152041435242},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.5064805746078491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3451361060142517},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.34410586953163147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3243252635002136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21967029571533203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21687346696853638},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21458756923675537},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.16986849904060364}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s0097539701392056","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701392056","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.5103","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.5103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/Library/TRs/CS-TR-3847/CS-TR-3847.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.677","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwpub.utdallas.edu/~rbk/papers/kdtsp.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.3226","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~moses/papers/capvehicle.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.9209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/users/samir/grant/ckr98.ps","raw_type":"text"},{"id":"pmh:oai:drum.lib.umd.edu:1903/923","is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/923","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2053298934","display_name":"RIA:  Approximation Algorithms for Hard Problems in Discrete Optimization","funder_award_id":"9409625","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8081833360","display_name":"NYI:  The Complexity of Probablistic Algorithms","funder_award_id":"9357849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8760196713","display_name":"CAREER:  Approximation Algorithms for Graph-Theoretic       Problems","funder_award_id":"9501355","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307065","display_name":"Schlumberger Foundation","ror":"https://ror.org/03daw3m97"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1985351788","https://openalex.org/W1994248285","https://openalex.org/W2046876986","https://openalex.org/W2075420967","https://openalex.org/W2078969731","https://openalex.org/W2085799273","https://openalex.org/W2089031378","https://openalex.org/W2143987816","https://openalex.org/W2155735286","https://openalex.org/W4214597234"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2018691209","https://openalex.org/W2054495636","https://openalex.org/W2046552997","https://openalex.org/W4312143452"],"abstract_inverted_index":{"Given":[0],"n":[1,19],"identical":[2],"objects":[3],"(pegs),":[4],"placed":[5],"at":[6,29,33,84],"arbitrary":[7],"initial":[8],"locations,":[9],"we":[10,146],"consider":[11],"the":[12,50,60,64,69,93,109,114,140,149,152],"problem":[13,37,61],"of":[14,49,62,75,139,151],"transporting":[15],"them":[16,89],"eciently":[17],"to":[18,40,103,116,122],"target":[20],"locations":[21,86],"(slots)":[22],"with":[23],"a":[24,34,47,56,124,130,136,161],"vehicle":[25],"that":[26,80,100,133,148],"can":[27],"carry":[28],"most":[30],"k":[31],"pegs":[32,83,102],"time.":[35],"This":[36],"is":[38,46,134,164],"referred":[39],"as":[41],"k-delivery":[42],"TSP,":[43],"and":[44,87,98],"it":[45],"generalization":[48],"Traveling":[51],"Salesman":[52],"Problem.":[53],"We":[54,128],"give":[55],"5-approximation":[57],"algorithm":[58],"for":[59,95],"minimizing":[63],"total":[65],"distance":[66],"traveled":[67,154],"by":[68,112,155,166],"vehicle.":[70],"There":[71],"are":[72],"two":[73],"kinds":[74],"transportations":[76],"possible":[77],"|":[78],"one":[79,99,118],"could":[81],"drop":[82],"intermediate":[85],"pick":[88],"up":[90],"later":[91],"in":[92],"route":[94],"delivery":[96,126],"(preemptive)":[97],"transports":[101],"their":[104],"targets":[105],"directly":[106],"(non-preemptive).":[107],"In":[108,144],"former":[110],"case,":[111],"exploiting":[113],"freedom":[115],"drop,":[117],"may":[119],"be":[120],"able":[121],"nd":[123],"shorter":[125],"route.":[127],"construct":[129],"non-preemptive":[131,158],"tour":[132,159,163],"within":[135],"factor":[137],"5":[138],"optimal":[141,157],"preemptive":[142,162],"tour.":[143],"addition":[145],"show":[147],"ratio":[150],"distances":[153],"an":[156],"versus":[160],"bounded":[165],"4.":[167]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}