{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:33:02Z","timestamp":1742941982703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_12","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"83-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Compact Formulation of the Fixed-Destination Travelling Salesman Problem by Cycle Imposement Through Node Currents"],"prefix":"10.1007","author":[{"given":"Mernout","family":"Burger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"12_CR1","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D. L., Bixby, R. E., Chv\u00e1tal, V., & Cook, W. J. (2006). The traveling salesman problem: a computational study. Princeton: Princeton University Press."},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bekta\u015f","year":"2006","unstructured":"Bekta\u015f, T. (2006). The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega, 34(3), 209\u2013219.","journal-title":"Omega"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejor.2011.07.020","volume":"216","author":"T Bekta\u015f","year":"2012","unstructured":"Bekta\u015f, T. (2012). Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing. European Journal of Operational Research, 216(1), 83\u201393.","journal-title":"European Journal of Operational Research"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Burger, M., De Schutter, B., & Hellendoorn, J. (2012). Micro-ferry scheduling problem with time windows. In proceedings of American Control Conference (pp. 3998\u20134003)","DOI":"10.1109\/ACC.2012.6315112"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Burger, M., & De Schutter, B. (2013). Energy-efficient transportation over flowing water. In proceedings of International Conference on Sensing and Control (ICNSC), pp. 226\u2013231","DOI":"10.1109\/ICNSC.2013.6548741"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Burger, M., Huiskamp, M., & Keviczky, T. (2013). Complete field coverage as a multiple harvester routing problem. In proceedings of Agriculture Control.","DOI":"10.3182\/20130828-2-SF-3019.00050"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27\u201336.","journal-title":"Operations Research Letters"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"G Golden","year":"2008","unstructured":"Golden, G., Raghavan, S., & Wasil, E. (2008). The vehicle routing problem: latest advances and new challenges. Berlin: Springer."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1016\/j.ejor.2005.03.008","volume":"174","author":"I Kara","year":"2006","unstructured":"Kara, I., & Bekta\u015f, T. (2006). Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174(3), 1449\u20131458.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7(4), 326\u2013329.","journal-title":"Journal of the ACM"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Sherali, H. D., & Driscoll, P. J. (2002). On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems. Operations Research, 50(4), 656\u2013669.","DOI":"10.1287\/opre.50.4.656.2865"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. SIAM","DOI":"10.1137\/1.9780898718515"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:05:24Z","timestamp":1676873124000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_12","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}