{"id":"https://openalex.org/W2131970767","doi":"https://doi.org/10.1145/2463596.2463601","title":"Solving the simple offset assignment problem as a traveling salesman","display_name":"Solving the simple offset assignment problem as a traveling salesman","publication_year":2013,"publication_date":"2013-06-18","ids":{"openalex":"https://openalex.org/W2131970767","doi":"https://doi.org/10.1145/2463596.2463601","mag":"2131970767"},"language":"en","primary_location":{"id":"doi:10.1145/2463596.2463601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463596.2463601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},"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/A5016595075","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-7574-6646"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":["Universit\u00e4t zu K\u00f6ln, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t zu K\u00f6ln, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025296970","display_name":"Sven Mallach","orcid":"https://orcid.org/0000-0001-5335-0678"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sven Mallach","raw_affiliation_strings":["Universit\u00e4t zu K\u00f6ln, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t zu K\u00f6ln, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":null,"apc_paid":null,"fwci":0.5447,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.60087489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9975000023841858,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8283830881118774},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7771965265274048},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.6893370747566223},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6671275496482849},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6486404538154602},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5927828550338745},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5755507349967957},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.507440984249115},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49962735176086426},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.48855218291282654},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.462685227394104},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43503546714782715},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4166716933250427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24509704113006592}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8283830881118774},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7771965265274048},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.6893370747566223},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6671275496482849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6486404538154602},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5927828550338745},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5755507349967957},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.507440984249115},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49962735176086426},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.48855218291282654},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.462685227394104},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43503546714782715},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4166716933250427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24509704113006592},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2463596.2463601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463596.2463601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:USBKOELN.ub.uni-koeln.de:55046","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-5335-0678>","pdf_url":null,"source":{"id":"https://openalex.org/S4306462769","display_name":"ACM eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"ebook platform"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:700","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W34041591","https://openalex.org/W109597122","https://openalex.org/W1482387194","https://openalex.org/W1492764233","https://openalex.org/W1502497305","https://openalex.org/W1523929277","https://openalex.org/W1531729176","https://openalex.org/W1587744319","https://openalex.org/W1973164084","https://openalex.org/W1981718090","https://openalex.org/W1986997541","https://openalex.org/W1998044834","https://openalex.org/W1999095027","https://openalex.org/W2017708378","https://openalex.org/W2042986967","https://openalex.org/W2058937865","https://openalex.org/W2072339136","https://openalex.org/W2072789827","https://openalex.org/W2078041678","https://openalex.org/W2103552119","https://openalex.org/W2104891966","https://openalex.org/W2105071525","https://openalex.org/W2138122372","https://openalex.org/W2143394728","https://openalex.org/W2157959047","https://openalex.org/W2327315803","https://openalex.org/W2399100674","https://openalex.org/W3004322657","https://openalex.org/W4241226388"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,89],"present":[4,90],"an":[5],"exact":[6],"approach":[7,50],"to":[8,31,52,62,80],"the":[9,16,41,48,57,70,74,81,86],"Simple":[10],"Offset":[11],"Assignment":[12],"problem":[13],"arising":[14],"in":[15],"domain":[17],"of":[18,43,56,73,76],"address":[19],"code":[20],"generation":[21],"for":[22],"digital":[23],"signal":[24],"processors.":[25],"It":[26,67],"is":[27,47],"based":[28],"on":[29],"transformations":[30],"weighted":[32],"Hamiltonian":[33],"cycle":[34],"problems":[35],"and":[36,103],"integer":[37],"linear":[38],"programming.":[39],"To":[40],"best":[42],"our":[44],"knowledge,":[45],"it":[46],"rst":[49,71],"capable":[51],"solve":[53],"all":[54],"instances":[55],"established":[58],"OffsetStone":[59],"benchmark":[60],"set":[61],"optimality":[63],"within":[64],"reasonable":[65],"time.":[66],"therefore":[68],"enables":[69],"evaluation":[72],"quality":[75],"several":[77],"heuristics":[78],"relative":[79],"optimum":[82],"solutions.":[83],"Further,":[84],"using":[85],"same":[87],"transformations,":[88],"a":[91,97],"novel":[92],"improvement":[93],"heuristic":[94],"that":[95],"provides":[96],"well-tunable":[98],"trade-off":[99],"between":[100],"running":[101],"time":[102],"solution":[104],"quality.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}