{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:11:31Z","timestamp":1775070691641,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T00:00:00Z","timestamp":1706400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T00:00:00Z","timestamp":1706400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-023-01097-4","type":"journal-article","created":{"date-parts":[[2024,1,28]],"date-time":"2024-01-28T06:01:56Z","timestamp":1706421716000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A branch-and-cut algorithm for the balanced traveling salesman problem"],"prefix":"10.1007","volume":"47","author":[{"given":"Thi Quynh Trang","family":"Vo","sequence":"first","affiliation":[]},{"given":"Mourad","family":"Baiou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2181-3847","authenticated-orcid":false,"given":"Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,28]]},"reference":[{"issue":"2","key":"1097_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/S0097539797320281","volume":"29","author":"EM Arkin","year":"1999","unstructured":"Arkin EM, Chiang Y-J, Mitchell JSB, Skiena SS, Yang T-C (1999) On the maximum scatter traveling salesperson problem. SIAM J Comput 29(2):515\u2013544","journal-title":"SIAM J Comput"},{"issue":"2\u20133","key":"1097_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","volume":"15","author":"PM Camerini","year":"1986","unstructured":"Camerini PM, Maffioli F, Martello S, Toth P (1986) Most and least uniform spanning trees. Discrete Appl Math 15(2\u20133):181\u2013197","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1097_CR3","first-page":"104","volume":"45","author":"P Cappanera","year":"2005","unstructured":"Cappanera P, Scutella MG (2005) Balanced paths in acyclic networks: tractable cases and related approaches. Netw Int J 45(2):104\u2013111","journal-title":"Netw Int J"},{"key":"1097_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0166-218X(88)90062-5","volume":"20","author":"Z Galil","year":"1988","unstructured":"Galil Z, Schieber B (1988) On finding most uniform spanning trees. Discrete Appl Math 20:173\u2013175","journal-title":"Discrete Appl Math"},{"issue":"4","key":"1097_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551\u2013570","journal-title":"J Soc Ind Appl Math"},{"key":"1097_CR6","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networks. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th python in science conference, Pasadena, CA USA, pp 11 \u2013 15","DOI":"10.25080\/TCWV9851"},{"issue":"2","key":"1097_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun K (2009) General k-opt submoves for the Lin\u2013Kernighan TSP heuristic. Math Program Comput 1(2):119\u2013163","journal-title":"Math Program Comput"},{"key":"1097_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/net.3230240705","volume":"24","author":"N Katoh","year":"1994","unstructured":"Katoh N, Iwano K (1994) Efficient algorithms for minimum range cut problems. Networks 24:395\u2013407","journal-title":"Networks"},{"issue":"5","key":"1097_CR9","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.cor.2010.09.016","volume":"38","author":"J Larusic","year":"2011","unstructured":"Larusic J, Punnen AP (2011) The balanced traveling salesman problem. Comput Oper Res 38(5):868\u2013875","journal-title":"Comput Oper Res"},{"key":"1097_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.cor.2013.08.005","volume":"43","author":"J LaRusic","year":"2014","unstructured":"LaRusic J, Punnen AP (2014) The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis. Comput Oper Res 43:20\u201335","journal-title":"Comput Oper Res"},{"issue":"10","key":"1097_CR11","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"issue":"5","key":"1097_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","volume":"3","author":"S Martello","year":"1984","unstructured":"Martello S, Pulleyblank WR, Toth P, De Werra D (1984) Balanced optimization problems. Oper Res Lett 3(5):275\u2013278","journal-title":"Oper Res Lett"},{"issue":"5","key":"1097_CR13","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1287\/opre.35.5.772","volume":"35","author":"RD Plante","year":"1987","unstructured":"Plante RD, Lowe TJ, Chandrasekaran R (1987) The product matrix traveling salesman problem: an application and solution heuristic. Oper Res 35(5):772\u2013783","journal-title":"Oper Res"},{"issue":"4","key":"1097_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"1\u20133","key":"1097_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0166-218X(97)88001-8","volume":"81","author":"MG Scutell\u00e0","year":"1998","unstructured":"Scutell\u00e0 MG (1998) A strongly polynomial algorithm for the uniform balanced network flow problem. Discrete Appl Math 81(1\u20133):123\u2013131","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1097_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"key":"1097_CR17","first-page":"91","volume":"6","author":"L Turner","year":"2011","unstructured":"Turner L (2011) Variants of shortest path problems. Algorithmic Oper Res 6:91\u2013104","journal-title":"Algorithmic Oper Res"},{"issue":"6","key":"1097_CR18","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0167-6377(03)00050-6","volume":"31","author":"GL Vairaktarakis","year":"2003","unstructured":"Vairaktarakis GL (2003) On Gilmore\u2013Gomory\u2019s open question for the bottleneck tsp. Oper Res Lett 31(6):483\u2013491","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01097-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01097-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01097-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T10:06:31Z","timestamp":1731146791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01097-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,28]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1097"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01097-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,28]]},"assertion":[{"value":"28 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declartions"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"4"}}