{"id":"https://openalex.org/W2004604480","doi":"https://doi.org/10.1007/s00453-004-1088-z","title":"Online and Offline Algorithms for the Time-Dependent TSP with Time Zones","display_name":"Online and Offline Algorithms for the Time-Dependent TSP with Time Zones","publication_year":2004,"publication_date":"2004-03-29","ids":{"openalex":"https://openalex.org/W2004604480","doi":"https://doi.org/10.1007/s00453-004-1088-z","mag":"2004604480"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1088-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1088-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":true,"oa_status":"green","oa_url":"https://mau.diva-portal.org/smash/get/diva2:1399147/FULLTEXT01","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054571644","display_name":"Bj\u00f6rn Brod\u00e9n","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bj\u00f6rn Brod\u00e9n","raw_affiliation_strings":["Department of Computer Science, Lund University,\n           Box 118, S-221 00 Lund, Sweden","Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University,\n           Box 118, S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089036996","display_name":"Mikael Hammar","orcid":null},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Mikael Hammar","raw_affiliation_strings":["Dipartimento di Informatica ed Applicazioni, Universit\u00e0 di Salerno, Baronissi (SA) 84081, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica ed Applicazioni, Universit\u00e0 di Salerno, Baronissi (SA) 84081, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042232244","display_name":"Brengt J. Nilsson","orcid":null},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Brengt J. Nilsson","raw_affiliation_strings":["School of Technology and Society, Malm\u00f6 University College, SE-205 06 Malm\u00f6, Sweden","School of Technology and Society, Malm\u00f6 University College, SE-205 06 Malm\u00f6, Sweden#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology and Society, Malm\u00f6 University College, SE-205 06 Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]},{"raw_affiliation_string":"School of Technology and Society, Malm\u00f6 University College, SE-205 06 Malm\u00f6, Sweden#TAB#","institution_ids":["https://openalex.org/I183111857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042232244","https://openalex.org/A5054571644","https://openalex.org/A5089036996"],"corresponding_institution_ids":["https://openalex.org/I131729948","https://openalex.org/I183111857","https://openalex.org/I187531555"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.17825805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"4","first_page":"299","last_page":"319"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7474449872970581},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6910107135772705},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6739316582679749},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6490439176559448},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6245388984680176},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6082764267921448},{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.587602972984314},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5504221320152283},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5187876224517822},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46538272500038147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4593944549560547},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4311133027076721},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39760810136795044},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3431955575942993},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18607643246650696},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13805770874023438}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7474449872970581},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6910107135772705},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6739316582679749},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6490439176559448},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6245388984680176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6082764267921448},{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.587602972984314},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5504221320152283},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5187876224517822},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46538272500038147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4593944549560547},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4311133027076721},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39760810136795044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3431955575942993},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18607643246650696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13805770874023438},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-004-1088-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1088-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:DiVA.org:mau-2394","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-2394","pdf_url":"https://mau.diva-portal.org/smash/get/diva2:1399147/FULLTEXT01","source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:lup.lub.lu.se:30682cd4-e6b9-4ee4-a1bf-ab3f882b2376","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/279239","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0178-4617","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:muep.mau.se:2043/11287","is_oa":false,"landing_page_url":"http://hdl.handle.net/2043/11287","pdf_url":null,"source":{"id":"https://openalex.org/S4377196423","display_name":"Malm\u00f6 University Publications (Malm\u00f6 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183111857","host_organization_name":"Malm\u00f6 University","host_organization_lineage":["https://openalex.org/I183111857"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article, peer reviewed scientific"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:mau-2394","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-2394","pdf_url":"https://mau.diva-portal.org/smash/get/diva2:1399147/FULLTEXT01","source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004604480.pdf","grobid_xml":"https://content.openalex.org/works/W2004604480.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1550422722","https://openalex.org/W1862548325","https://openalex.org/W2054420170","https://openalex.org/W2054716257","https://openalex.org/W2066194644","https://openalex.org/W2068752469","https://openalex.org/W2072136110","https://openalex.org/W2098156747","https://openalex.org/W2141355868","https://openalex.org/W2155236335"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W575343561"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}
