{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:41:32Z","timestamp":1740120092192,"version":"3.37.3"},"reference-count":17,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T00:00:00Z","timestamp":1536105600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["691149"],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2019,7]]},"abstract":"Abstract<\/jats:title>The Steiner traveling salesman problem (StTSP) is a variant of the classical traveling salesman problem (TSP). In the StTSP, we are given a graph with edge distances, and a set of terminal nodes, which are a subset of all nodes. The goal is to find a minimum distance closed walk to visit each terminal node at least once. Two recent articles proposed solution approaches to the problem, namely, on the exact side,\u00a0Letchford et\u00a0al. proposed compact integer linear programming models, and on the heuristic side,\u00a0Interian and Ribeiro proposed greedy randomized adaptive search procedure, enhanced with a local search. Using the exact approach, instances with up to 250 nodes could be solved to optimality, with runtimes up to 1400 seconds, and the heuristic approach was used to tackle instances with up to 3353 nodes, with runtimes up to 8500 seconds. In this note, we show that by transforming the problem to the classical TSP, and using a state\u2010of\u2010the\u2010art TSP solver, all instances from the literature can be solved to optimality within 20 seconds, most of them within a second. We provide optimal solution values for 14 instances, where the optimal solution was not known.<\/jats:p>","DOI":"10.1111\/itor.12592","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T05:33:32Z","timestamp":1536212012000},"page":"1396-1401","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A note on computational aspects of the Steiner traveling salesman problem"],"prefix":"10.1111","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7788-0451","authenticated-orcid":false,"given":"Eduardo","family":"\u00c1lvarez\u2010Miranda","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering Universidad de Talca Merced 437 334000 Curic\u00f3 Chile"}]},{"given":"Markus","family":"Sinnl","sequence":"additional","affiliation":[{"name":"Faculty of Business, Economics and Statistics, Department of Statistics and Operations Research University of Vienna Oskar\u2010Morgenstern\u2010Platz 1 1090 Vienna Austria"}]}],"member":"311","published-online":{"date-parts":[[2018,9,5]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_4_2_1","DOI":"10.1007\/s10107-003-0440-4"},{"year":"2006","author":"Applegate D.","journal-title":"The Traveling Salesman Problem: A Computational Study","key":"e_1_2_4_3_1"},{"year":"2012","author":"Cook W.","journal-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","key":"e_1_2_4_4_1"},{"doi-asserted-by":"publisher","key":"e_1_2_4_5_1","DOI":"10.1007\/PL00011426"},{"doi-asserted-by":"publisher","key":"e_1_2_4_6_1","DOI":"10.1007\/BF01582008"},{"doi-asserted-by":"publisher","key":"e_1_2_4_7_1","DOI":"10.1007\/BF01386390"},{"doi-asserted-by":"publisher","key":"e_1_2_4_8_1","DOI":"10.1007\/BF01719842"},{"doi-asserted-by":"publisher","key":"e_1_2_4_9_1","DOI":"10.1016\/0377-2217(85)90151-1"},{"doi-asserted-by":"publisher","key":"e_1_2_4_10_1","DOI":"10.1145\/174147.169803"},{"year":"2002","author":"Gutin G.","journal-title":"The Traveling Salesman Problem and Its Variations","key":"e_1_2_4_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_4_12_1","DOI":"10.1111\/itor.12419"},{"doi-asserted-by":"publisher","key":"e_1_2_4_13_1","DOI":"10.1016\/j.ejor.2013.01.044"},{"unstructured":"McKinsey & Company 2016.How customer demands are reshaping last\u2010mile delivery. Available athttps:\/\/www.mckinsey.com\/industries\/travel\u2010transport\u2010and\u2010logistics\/our\u2010insights\/how\u2010customer\u2010demands\u2010are\u2010reshaping\u2010last\u2010mile\u2010delivery(accessed January 31 2018).","key":"e_1_2_4_14_1"},{"doi-asserted-by":"publisher","key":"e_1_2_4_15_1","DOI":"10.1051\/ro\/1981150302331"},{"doi-asserted-by":"publisher","key":"e_1_2_4_16_1","DOI":"10.1002\/net.3230040105"},{"doi-asserted-by":"publisher","key":"e_1_2_4_17_1","DOI":"10.1137\/1.9781611973594"},{"doi-asserted-by":"publisher","key":"e_1_2_4_18_1","DOI":"10.1016\/j.ins.2016.09.043"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fitor.12592","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/itor.12592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T05:59:27Z","timestamp":1694671167000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/itor.12592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,5]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["10.1111\/itor.12592"],"URL":"https:\/\/doi.org\/10.1111\/itor.12592","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"type":"print","value":"0969-6016"},{"type":"electronic","value":"1475-3995"}],"subject":[],"published":{"date-parts":[[2018,9,5]]},"assertion":[{"value":"2018-06-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}