{"id":"https://openalex.org/W2002806127","doi":"https://doi.org/10.1007/s10479-013-1308-5","title":"Fast approximation algorithms for routing problems with hop-wise constraints","display_name":"Fast approximation algorithms for routing problems with hop-wise constraints","publication_year":2013,"publication_date":"2013-01-18","ids":{"openalex":"https://openalex.org/W2002806127","doi":"https://doi.org/10.1007/s10479-013-1308-5","mag":"2002806127"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-013-1308-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-013-1308-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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/A5028888072","display_name":"Amir Elalouf","orcid":"https://orcid.org/0000-0001-7950-0785"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Amir Elalouf","raw_affiliation_strings":["Department of Management, Bar-Ilan University, Ramat-Gan, Israel","Department of Management, Bar-Ilan University , Ramat Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management, Bar-Ilan University, Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Department of Management, Bar-Ilan University , Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028888072"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07414984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"222","issue":"1","first_page":"279","last_page":"291"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9951000213623047,"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/maximization","display_name":"Maximization","score":0.5803678035736084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523536205291748},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.5212817192077637},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5159614682197571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5063496828079224},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5031549334526062},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4986081123352051},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4706615209579468},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43399178981781006},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.41160136461257935},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3914291262626648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.369819700717926},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22412875294685364},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07326194643974304}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5803678035736084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523536205291748},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.5212817192077637},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5159614682197571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5063496828079224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5031549334526062},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4986081123352051},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4706615209579468},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43399178981781006},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.41160136461257935},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3914291262626648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.369819700717926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22412875294685364},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07326194643974304},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10479-013-1308-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-013-1308-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:annopr:v:222:y:2014:i:1:p:279-291:10.1007/s10479-013-1308-5","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10479-013-1308-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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W57516052","https://openalex.org/W190732186","https://openalex.org/W264528716","https://openalex.org/W1964443412","https://openalex.org/W1968822565","https://openalex.org/W1990023680","https://openalex.org/W1998132337","https://openalex.org/W2030170468","https://openalex.org/W2052229697","https://openalex.org/W2061701207","https://openalex.org/W2065104488","https://openalex.org/W2074117023","https://openalex.org/W2092460679","https://openalex.org/W2130626677","https://openalex.org/W2157993733","https://openalex.org/W3145128584","https://openalex.org/W4233225156","https://openalex.org/W4292003697","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2900864464","https://openalex.org/W2475480881","https://openalex.org/W2121723556","https://openalex.org/W2288977275","https://openalex.org/W54727051","https://openalex.org/W2783639087","https://openalex.org/W2155956102","https://openalex.org/W2158144798","https://openalex.org/W2390244926","https://openalex.org/W2112820851"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}