{"id":"https://openalex.org/W2145466017","doi":"https://doi.org/10.1002/net.3230220106","title":"The n\u2010line traveling salesman problem","display_name":"The n\u2010line traveling salesman problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2145466017","doi":"https://doi.org/10.1002/net.3230220106","mag":"2145466017"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220106","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5083387191","display_name":"G\u00fcnter Rote","orcid":"https://orcid.org/0000-0002-0351-5945"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"G\u00fcnter Rote","raw_affiliation_strings":["Technische Universita\u0308t Graz Institut fu\u0308r Mathematik Steyrergasse 30, A-8010 Graz, Austria","Technische Universit\u00e4t Graz Institut f\u00fcr Mathematik Steyrergasse 30, A\u20108010 Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Technische Universita\u0308t Graz Institut fu\u0308r Mathematik Steyrergasse 30, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Technische Universit\u00e4t Graz Institut f\u00fcr Mathematik Steyrergasse 30, A\u20108010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083387191"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.0675,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.88583574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"1","first_page":"91","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9998000264167786,"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.9991999864578247,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9950000047683716,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.925845742225647},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.6887434720993042},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6791377663612366},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6173256635665894},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5645819306373596},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5478874444961548},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5473508834838867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5428656339645386},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5043038129806519},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4534010589122772},{"id":"https://openalex.org/keywords/parallel","display_name":"Parallel","score":0.445980042219162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3476621210575104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2911365330219269},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.22673851251602173},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1129416823387146}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.925845742225647},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.6887434720993042},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6791377663612366},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6173256635665894},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5645819306373596},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5478874444961548},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5473508834838867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5428656339645386},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5043038129806519},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4534010589122772},{"id":"https://openalex.org/C88740403","wikidata":"https://www.wikidata.org/wiki/Q53875","display_name":"Parallel","level":2,"score":0.445980042219162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3476621210575104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2911365330219269},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22673851251602173},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1129416823387146},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.3230220106","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220106","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.fu-berlin.de/~rote/Papers/postscript-gzipped/The+N-line+traveling+salesman+problem.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.1031","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.1031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.fu-berlin.de/~rote/Papers/pdf/The+N-line+traveling+salesman+problem.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W249091067","https://openalex.org/W1974784305","https://openalex.org/W2017932090","https://openalex.org/W2038774649","https://openalex.org/W2055336889","https://openalex.org/W2055569927","https://openalex.org/W2083210138","https://openalex.org/W2316369501","https://openalex.org/W2333518870","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W306301879","https://openalex.org/W2082043148","https://openalex.org/W4302600749","https://openalex.org/W3087382497","https://openalex.org/W956826600","https://openalex.org/W3115142359","https://openalex.org/W2057741690","https://openalex.org/W2994044385","https://openalex.org/W2601467812","https://openalex.org/W2044633689"],"abstract_inverted_index":{"Abstract":[0],"The":[1,88],"special":[2],"case":[3],"of":[4,21,51,65,82,109,117],"the":[5,11,25,63,70,83,110],"Euclidean":[6],"traveling":[7],"salesman":[8],"problem,":[9],"where":[10,69],"n":[12,36],"given":[13],"points":[14],"lie":[15,98],"on":[16,99],"a":[17,30,49,74,107,115],"small":[18],"number":[19],"(N)":[20],"parallel":[22],"lines":[23],"in":[24,34,44,62,79],"plane,":[26],"is":[27],"solved":[28],"by":[29,73,114],"dynamic":[31],"programming":[32],"approach":[33],"time":[35],"N":[37,41,100],",":[38,42],"for":[39,54,60],"fixed":[40],"i.e.,":[43],"polynomial":[45],"time.":[46],"This":[47],"extends":[48],"result":[50],"Cutler":[52],"(1980)":[53],"three":[55],"lines.":[56],"Such":[57],"problems":[58],"arise,":[59],"example,":[61],"fabrication":[64],"printed":[66],"circuit":[67],"boards,":[68],"distance":[71],"traveled":[72],"laser":[75],"that":[76,97],"drills":[77],"holes":[78],"certain":[80],"places":[81],"board":[84],"should":[85],"be":[86,92],"minimized.":[87],"parallelity":[89],"condition":[90],"can":[91],"relaxed":[93],"to":[94],"point":[95],"sets":[96],"\u201calmost":[101],"parallel\u201d":[102],"line":[103],"segments.":[104],"We":[105],"give":[106],"characterization":[108],"allowed":[111],"segment":[112],"configurations":[113],"set":[116],"forbidden":[118],"subconfigurations.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}