{"id":"https://openalex.org/W2569598970","doi":"https://doi.org/10.1007/978-3-642-04128-0_48","title":"Minimum Makespan Multi-vehicle Dial-a-Ride","display_name":"Minimum Makespan Multi-vehicle Dial-a-Ride","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2569598970","doi":"https://doi.org/10.1007/978-3-642-04128-0_48","mag":"2569598970"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04128-0_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04128-0_48","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"],"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/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/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":3,"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":1.9145,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89962121,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"540","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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.9987000226974487,"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.9950000047683716,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.993399977684021,"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/vertex","display_name":"Vertex (graph theory)","score":0.6810787320137024},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5897029638290405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.577862024307251},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.542569100856781},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.48278748989105225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46533408761024475},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4336177110671997},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42781922221183777},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42416226863861084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3677910268306732},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3085471987724304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3075316548347473},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.12370491027832031},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10870325565338135},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10060897469520569}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6810787320137024},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5897029638290405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.577862024307251},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.542569100856781},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.48278748989105225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46533408761024475},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4336177110671997},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42781922221183777},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42416226863861084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3677910268306732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3085471987724304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3075316548347473},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12370491027832031},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10870325565338135},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10060897469520569},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-04128-0_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04128-0_48","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1500932665","https://openalex.org/W1506243241","https://openalex.org/W2005362242","https://openalex.org/W2006527299","https://openalex.org/W2010587722","https://openalex.org/W2017383000","https://openalex.org/W2042899161","https://openalex.org/W2063659595","https://openalex.org/W2077626805","https://openalex.org/W2082353536","https://openalex.org/W2100961486","https://openalex.org/W2117324637","https://openalex.org/W2137716917","https://openalex.org/W2143987816","https://openalex.org/W2155735286","https://openalex.org/W2156760067","https://openalex.org/W2167397341","https://openalex.org/W2168563161","https://openalex.org/W2398231527","https://openalex.org/W2950368606","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2018691209","https://openalex.org/W1974309933","https://openalex.org/W2970302286","https://openalex.org/W4213379045","https://openalex.org/W2810352541","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W2142195909"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}