{"id":"https://openalex.org/W1902458947","doi":"https://doi.org/10.1007/s00453-007-9011-z","title":"Approximation Algorithms for Multi-Criteria Traveling Salesman Problems","display_name":"Approximation Algorithms for Multi-Criteria Traveling Salesman Problems","publication_year":2007,"publication_date":"2007-09-14","ids":{"openalex":"https://openalex.org/W1902458947","doi":"https://doi.org/10.1007/s00453-007-9011-z","mag":"1902458947"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9011-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9011-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT, 06520-8285, USA","Yale University, Department of Computer Science, P.O. Box 208285, 06520-8285, New Haven, CT, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT, 06520-8285, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale University, Department of Computer Science, P.O. Box 208285, 06520-8285, New Haven, CT, USA#TAB#","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029020542","display_name":"L. Shankar Ram","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"L. Shankar Ram","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, ETH Z\u00fcrich, 8092, Z\u00fcrich, Switzerland","ETH Z\u00fcrich, Institut f\u00fcr Theoretische Informatik, 8092, Z\u00fcrich, Switzerland#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, ETH Z\u00fcrich, 8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Z\u00fcrich, Institut f\u00fcr Theoretische Informatik, 8092, Z\u00fcrich, Switzerland#TAB#","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002315999"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":7.629,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96399155,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"53","issue":"1","first_page":"69","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8335206508636475},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7432340979576111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6799763441085815},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.640354335308075},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.612969160079956},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4737480580806732},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43910765647888184},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41139835119247437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39405500888824463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.349590003490448},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1358310878276825}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8335206508636475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7432340979576111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6799763441085815},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.640354335308075},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.612969160079956},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4737480580806732},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43910765647888184},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41139835119247437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39405500888824463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.349590003490448},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1358310878276825}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9011-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9011-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/3a165353-aa72-405c-b0d0-f8b529134a90","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/3a165353-aa72-405c-b0d0-f8b529134a90","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Manthey, B & Shankar Ram, L 2009, 'Approximation algorithms for multi-criteria traveling salesman problems', Algorithmica, vol. 53, no. 1, pp. 69-88. https://doi.org/10.1007/s00453-007-9011-z","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324516","display_name":"Southern Taiwan Science Park","ror":"https://ror.org/059e60q69"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W140130170","https://openalex.org/W959799004","https://openalex.org/W1500758801","https://openalex.org/W1553729051","https://openalex.org/W1557818090","https://openalex.org/W1571087346","https://openalex.org/W1603843698","https://openalex.org/W1928381443","https://openalex.org/W1963770385","https://openalex.org/W1965255372","https://openalex.org/W1981234161","https://openalex.org/W2011039300","https://openalex.org/W2019570365","https://openalex.org/W2022179164","https://openalex.org/W2025698306","https://openalex.org/W2033501672","https://openalex.org/W2056215713","https://openalex.org/W2063245286","https://openalex.org/W2079828065","https://openalex.org/W2083743691","https://openalex.org/W2137560895","https://openalex.org/W2167197687","https://openalex.org/W2317309498","https://openalex.org/W2324108981","https://openalex.org/W2476096155","https://openalex.org/W2486715098","https://openalex.org/W2610479830","https://openalex.org/W2611804663","https://openalex.org/W2615258659","https://openalex.org/W2956015669","https://openalex.org/W4230573295","https://openalex.org/W4240555338","https://openalex.org/W4241708030","https://openalex.org/W4285719527","https://openalex.org/W4294358747","https://openalex.org/W4302557773","https://openalex.org/W6633936085"],"related_works":["https://openalex.org/W2025698306","https://openalex.org/W1481223916","https://openalex.org/W2149302127","https://openalex.org/W2035448415","https://openalex.org/W2032550399","https://openalex.org/W1850573590","https://openalex.org/W2057791178","https://openalex.org/W2038858023","https://openalex.org/W2003502867","https://openalex.org/W2561136735"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}