{"id":"https://openalex.org/W2186930354","doi":"https://doi.org/10.1007/s10878-015-9931-5","title":"Approximation schemes for Euclidean vehicle routing problems with time windows","display_name":"Approximation schemes for Euclidean vehicle routing problems with time windows","publication_year":2015,"publication_date":"2015-07-17","ids":{"openalex":"https://openalex.org/W2186930354","doi":"https://doi.org/10.1007/s10878-015-9931-5","mag":"2186930354"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-015-9931-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9931-5","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5101797711","display_name":"Liang Song","orcid":"https://orcid.org/0000-0003-2017-1512"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Liang Song","raw_affiliation_strings":["Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006819425","display_name":"Hejiao Huang","orcid":"https://orcid.org/0000-0002-2030-957X"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hejiao Huang","raw_affiliation_strings":["Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077298638","display_name":"Hongwei Du","orcid":"https://orcid.org/0000-0002-5312-4037"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Du","raw_affiliation_strings":["Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101797711"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":12.089,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.98552106,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"32","issue":"4","first_page":"1217","last_page":"1231"},"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.9983999729156494,"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.9919999837875366,"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.8797298669815063},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.79027259349823},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7627623081207275},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6563812494277954},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6452220678329468},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5780653357505798},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5524465441703796},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.518523097038269},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5042003393173218},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48902973532676697},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4724602699279785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44348037242889404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4421318769454956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28727924823760986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24793994426727295},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08956784009933472},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08379009366035461},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07832252979278564}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8797298669815063},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.79027259349823},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7627623081207275},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6563812494277954},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6452220678329468},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5780653357505798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5524465441703796},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.518523097038269},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5042003393173218},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48902973532676697},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4724602699279785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44348037242889404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4421318769454956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28727924823760986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24793994426727295},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08956784009933472},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08379009366035461},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07832252979278564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-015-9931-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-015-9931-5","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9931-5","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-015-9931-5","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3107052035","display_name":null,"funder_award_id":"61370216","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7807711581","display_name":null,"funder_award_id":"11071271; 11371004","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1520111182","https://openalex.org/W1601649239","https://openalex.org/W1965032790","https://openalex.org/W1967713980","https://openalex.org/W1972755385","https://openalex.org/W2005650729","https://openalex.org/W2009990213","https://openalex.org/W2018236017","https://openalex.org/W2043800474","https://openalex.org/W2056479729","https://openalex.org/W2084517609","https://openalex.org/W2089310860","https://openalex.org/W2090424605","https://openalex.org/W2111563176","https://openalex.org/W2143058845","https://openalex.org/W2145028977","https://openalex.org/W2155735286","https://openalex.org/W2165142526","https://openalex.org/W2186967362","https://openalex.org/W2332737685","https://openalex.org/W2950822301","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2059001284","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2799046353","https://openalex.org/W2032550399","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W2057791178","https://openalex.org/W1443174385","https://openalex.org/W1769833081"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":17}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}