{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T11:41:35Z","timestamp":1778067695053,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0106"],"award-info":[{"award-number":["FA9550-19-1-0106"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10589-023-00474-3","type":"journal-article","created":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T20:02:13Z","timestamp":1680724933000},"page":"369-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Results for the close-enough traveling salesman problem with a branch-and-bound algorithm"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8672-4100","authenticated-orcid":false,"given":"Wenda","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jason J.","family":"Sauppe","sequence":"additional","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,5]]},"reference":[{"key":"474_CR1","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: Concorde. Available at: http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html (2003)"},{"key":"474_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, New Jersey, USA (2006)"},{"issue":"3","key":"474_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/ijoc.2013.0574","volume":"26","author":"B Behdani","year":"2014","unstructured":"Behdani, B., Smith, J.C.: An integer-programming-based approach to the close-enough traveling salesman problem. INFORMS J. Comput. 26(3), 415\u2013432 (2014)","journal-title":"INFORMS J. Comput."},{"key":"474_CR4","doi-asserted-by":"crossref","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., D\u2019Ambrosio, C.: Improved upper and lower bounds for the close enough traveling salesman problem. In: International Conference on Green, Pervasive, and Cloud Computing, Springer, pp 165\u2013177 (2017a)","DOI":"10.1007\/978-3-319-57186-7_14"},{"key":"474_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2016.09.003","volume":"78","author":"F Carrabs","year":"2017","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Op. Res. 78, 163\u2013171 (2017)","journal-title":"Comput. Op. Res."},{"issue":"4","key":"474_CR6","first-page":"1030","volume":"32","author":"F Carrabs","year":"2020","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., Golden, B.: An adaptive heuristic approach to compute upper and lower bounds for the close-enough traveling salesman problem. INFORMS J. Comput. 32(4), 1030\u20131048 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"474_CR7","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1287\/ijoc.2016.0711","volume":"28","author":"WP Coutinho","year":"2016","unstructured":"Coutinho, W.P., Nascimento, R.Q., Pessoa, A.A., Subramanian, A.: A branch-and-bound algorithm for the close-enough traveling salesman problem. INFORMS J. Comput. 28(4), 752\u2013765 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"474_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"474_CR9","doi-asserted-by":"crossref","unstructured":"Dong, J., Yang, N., Chen, M. (2007). Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem. In: Baker, E.K., Joseph, A., Mehrotra, A., Trick, M.A. (eds.). Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies. Operations Research\/Computer Science Interfaces Series, vol. 37. Springer, Boston, MA","DOI":"10.1007\/978-0-387-48793-9_10"},{"key":"474_CR10","doi-asserted-by":"crossref","unstructured":"Gulczynski, D.J., Heath, J.W., Price, C.C. (2006). The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics. In: Alt, F.B., Fu, M.C., Golden, B.L. (eds.). Perspectives in Operations Research. Operations Research\/Computer Science Interfaces Series, vol. 36. Springer, Boston, MA","DOI":"10.1007\/978-0-387-39934-8_16"},{"issue":"2","key":"474_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10951-008-0087-3","volume":"12","author":"GK Kao","year":"2009","unstructured":"Kao, G.K., Sewell, E.C., Jacobson, S.H.: A branch, bound, and remember algorithm for the $$1 |r_i| \\sum t_i$$ scheduling problem. J. Sched. 12(2), 163\u2013175 (2009)","journal-title":"J. Sched."},{"key":"474_CR12","unstructured":"Leandro, C.: Install and run concorde with cplex. https:\/\/www.leandro-coelho.com\/install-and-run-concorde-with-cplex\/ (2019)"},{"key":"474_CR13","unstructured":"Mennell, W.: Heuristics for solving three routing problems: close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. PhD thesis (2009)"},{"key":"474_CR14","doi-asserted-by":"crossref","unstructured":"Mennell, W., Golden, B., Wasil, E.: A steiner-zone heuristic for solving the close-enough traveling salesman problem. In: 2th INFORMS Computing Society Conference: Operations Research, Computing, and Homeland Defense (2011)","DOI":"10.1287\/ics.2011.0004"},{"issue":"2","key":"474_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ejor.2013.11.033","volume":"236","author":"DR Morrison","year":"2014","unstructured":"Morrison, D.R., Sewell, E.C., Jacobson, S.H.: An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. Eur. J. Oper. Res. 236(2), 403\u2013409 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"474_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1002\/nav.21732","volume":"64","author":"DR Morrison","year":"2017","unstructured":"Morrison, D.R., Sauppe, J.J., Zhang, W., Jacobson, S.H., Sewell, E.C.: Cyclic best first search:using contours to guide branch-and-bound algorithms. Naval Res. Logist. (NRL) 64(1), 64\u201382 (2017)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"3","key":"474_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/ijoc.1110.0462","volume":"24","author":"EC Sewell","year":"2012","unstructured":"Sewell, E.C., Jacobson, S.H.: A branch, bound, and remember algorithm for the simple assembly line balancing problem. INFORMS J. Comput. 24(3), 433\u2013442 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"474_CR18","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10898-011-9793-z","volume":"54","author":"EC Sewell","year":"2012","unstructured":"Sewell, E.C., Sauppe, J.J., Morrison, D.R., Jacobson, S.H., Kao, G.: A BB &R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Glob. Optim. 54(4), 791\u2013812 (2012)","journal-title":"J. Glob. Optim."},{"key":"474_CR19","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.cor.2018.07.023","volume":"101","author":"X Wang","year":"2019","unstructured":"Wang, X., Golden, B., Wasil, E.: A steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem. Comput. Oper. Res. 101, 200\u2013219 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"474_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ejor.2017.07.024","volume":"265","author":"Z Yang","year":"2018","unstructured":"Yang, Z., Xiao, M.Q., Ge, Y.W., Feng, D.L., Zhang, L., Song, H.F., Tang, X.L.: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods. Eur. J. Oper. Res. 265(1), 65\u201380 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"474_CR21","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/TKDE.2007.1062","volume":"19","author":"B Yuan","year":"2007","unstructured":"Yuan, B., Orlowska, M., Sadiq, S.: On the optimal robot routing problem in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 19(9), 1252\u20131261 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"474_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, W., Sauppe, J.J., Jacobson, S.H.: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. INFORMS J Comput. 33(3):1091\u20131102 (2020)","DOI":"10.1287\/ijoc.2020.0988"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00474-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00474-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00474-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:06:11Z","timestamp":1683788771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00474-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00474-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,5]]},"assertion":[{"value":"5 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}