{"id":"https://openalex.org/W2949660560","doi":"https://doi.org/10.1007/978-3-030-22629-9_22","title":"Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand","display_name":"Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2949660560","doi":"https://doi.org/10.1007/978-3-030-22629-9_22","mag":"2949660560"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-22629-9_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-22629-9_22","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":"conference-paper","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/A5050865451","display_name":"Michael Khachay","orcid":"https://orcid.org/0000-0003-3555-0080"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]},{"id":"https://openalex.org/I20119556","display_name":"Omsk State Technical University","ror":"https://ror.org/01kzjg088","country_code":"RU","type":"education","lineage":["https://openalex.org/I20119556"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Michael Khachay","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Ural Federal University, Ekaterinburg, Russia","Omsk State Technical University, Omsk, Russia"],"raw_orcid":"https://orcid.org/0000-0003-3555-0080","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]},{"raw_affiliation_string":"Omsk State Technical University, Omsk, Russia","institution_ids":["https://openalex.org/I20119556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073108174","display_name":"Yuri Ogorodnikov","orcid":"https://orcid.org/0000-0002-1750-1368"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]},{"id":"https://openalex.org/I4210105350","display_name":"N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences","ror":"https://ror.org/029fhmb28","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210105350","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Yuri Ogorodnikov","raw_affiliation_strings":["Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","Ural Federal University, Ekaterinburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-1750-1368","affiliations":[{"raw_affiliation_string":"Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I4210105350"]},{"raw_affiliation_string":"Ural Federal University, Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050865451"],"corresponding_institution_ids":["https://openalex.org/I130823665","https://openalex.org/I20119556","https://openalex.org/I4210105350"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.6785,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.94694483,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9969000220298767,"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/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7344715595245361},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.7164987921714783},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6782447099685669},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6035640239715576},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5813060998916626},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5791168212890625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5096621513366699},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46802884340286255},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43194591999053955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39183855056762695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39145320653915405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35255807638168335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32684609293937683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30672717094421387},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08530533313751221}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7344715595245361},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.7164987921714783},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6782447099685669},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6035640239715576},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5813060998916626},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5791168212890625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5096621513366699},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46802884340286255},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43194591999053955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39183855056762695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39145320653915405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35255807638168335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32684609293937683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30672717094421387},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08530533313751221},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-22629-9_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-22629-9_22","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":33,"referenced_works":["https://openalex.org/W978527144","https://openalex.org/W1551038165","https://openalex.org/W1780088415","https://openalex.org/W1972645701","https://openalex.org/W1974791820","https://openalex.org/W2035874923","https://openalex.org/W2055569927","https://openalex.org/W2076764190","https://openalex.org/W2111563176","https://openalex.org/W2133264981","https://openalex.org/W2151148851","https://openalex.org/W2155735286","https://openalex.org/W2165142526","https://openalex.org/W2180406249","https://openalex.org/W2186930354","https://openalex.org/W2251882317","https://openalex.org/W2295683163","https://openalex.org/W2301290695","https://openalex.org/W2404658402","https://openalex.org/W2559541197","https://openalex.org/W2568219823","https://openalex.org/W2604736088","https://openalex.org/W2607445217","https://openalex.org/W2769656066","https://openalex.org/W2801697125","https://openalex.org/W2889438244","https://openalex.org/W2891701040","https://openalex.org/W2891719863","https://openalex.org/W2907615029","https://openalex.org/W2909651232","https://openalex.org/W2966058519","https://openalex.org/W3012882765","https://openalex.org/W4252801674"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W1443174385","https://openalex.org/W2732982824","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}