{"id":"https://openalex.org/W1636918467","doi":"https://doi.org/10.1007/978-3-642-20807-2_19","title":"Capacitated Vehicle Routing with Non-uniform Speeds","display_name":"Capacitated Vehicle Routing with Non-uniform Speeds","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1636918467","doi":"https://doi.org/10.1007/978-3-642-20807-2_19","mag":"1636918467"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-20807-2_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20807-2_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Capacitated_Vehicle_Routing_with_Non-uniform_Speeds/6704315","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070148734","display_name":"Inge Li G\u00f8rtz","orcid":"https://orcid.org/0000-0002-8322-4952"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Inge Li G\u00f8rtz","raw_affiliation_strings":["Technical University of Denmark, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091196390","display_name":"Marco Molinaro","orcid":"https://orcid.org/0000-0003-0174-3204"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marco Molinaro","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["IBM T.J. Watson Research Center, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070148734"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.775,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.92820201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9914000034332275,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7724639177322388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6030756235122681},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5780669450759888},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.557041585445404},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5498908162117004},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5381371378898621},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5024881362915039},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5017962455749512},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5010418891906738},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4986746311187744},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4950043559074402},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4888712763786316},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46414390206336975},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44414424896240234},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43518081307411194},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43177276849746704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4025127589702606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31344810128211975},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08226710557937622}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7724639177322388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6030756235122681},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5780669450759888},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.557041585445404},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5498908162117004},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5381371378898621},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5024881362915039},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5017962455749512},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5010418891906738},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4986746311187744},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4950043559074402},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4888712763786316},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46414390206336975},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44414424896240234},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43518081307411194},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43177276849746704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4025127589702606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31344810128211975},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08226710557937622},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/978-3-642-20807-2_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-20807-2_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.206.3356","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.3356","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.gsia.cmu.edu/andrew/ravi/public/ipco11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.759.3345","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.759.3345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1012.1850.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/6704315","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Capacitated_Vehicle_Routing_with_Non-uniform_Speeds/6704315","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:pure.atira.dk:publications/08f023cd-a6db-4f21-8f49-e8bc6f8c7ca5","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/08f023cd-a6db-4f21-8f49-e8bc6f8c7ca5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"G\u00f8rtz , I L , Molinaro , M , Nagarajan , V & Ravi , R 2011 , Capacitated Vehicle Routing with Non-Uniform Speeds . in Lecture Notes in Computer Science : The 15th Conference on Integer Programming and Combinatorial Optimization . vol. 6655/2011 , Springer , Berlin , Lecture Notes in Computer Science , pp. 235-247 , 15th International Conference on Integer Programming and Combinatoral Optimization , New York , New York , United States , 15/06/2011 . https://doi.org/10.1007/978-3-642-20807-2_19","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/e627e902-6d4f-4d07-ad10-c92473081769","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/e627e902-6d4f-4d07-ad10-c92473081769","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"G\u00f8rtz , I L , Molinaro , M , Nagarajan , V & Ravi , R 2016 , ' Capacitated Vehicle Routing with Non-Uniform Speeds ' , Mathematics of Operations Research , vol. 41 , no. 1 , pp. 318-331 . https://doi.org/10.1287/moor.2015.0729","raw_type":"article"},{"id":"doi:10.1184/r1/6704315.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6704315.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6704315","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Capacitated_Vehicle_Routing_with_Non-uniform_Speeds/6704315","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482405521","https://openalex.org/W1601649239","https://openalex.org/W1972755385","https://openalex.org/W1974713906","https://openalex.org/W1994248285","https://openalex.org/W2009006795","https://openalex.org/W2017372614","https://openalex.org/W2023848998","https://openalex.org/W2038190710","https://openalex.org/W2049733361","https://openalex.org/W2063838679","https://openalex.org/W2071701840","https://openalex.org/W2090424605","https://openalex.org/W2102201348","https://openalex.org/W2113939799","https://openalex.org/W2117226423","https://openalex.org/W2141105412","https://openalex.org/W2143987816","https://openalex.org/W2148026779","https://openalex.org/W2155735286","https://openalex.org/W2165142526","https://openalex.org/W2340149117","https://openalex.org/W2622090745","https://openalex.org/W2913132751","https://openalex.org/W2951475756","https://openalex.org/W4213351738","https://openalex.org/W4245530386","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W4312143452","https://openalex.org/W3005108979","https://openalex.org/W2970302286","https://openalex.org/W2810352541"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}