{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T11:32:15Z","timestamp":1765279935357,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319339535"},{"type":"electronic","value":"9783319339542"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33954-2_5","type":"book-chapter","created":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T11:00:09Z","timestamp":1462964409000},"page":"55-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Logic-Based Decomposition Methods for the Travelling Purchaser Problem"],"prefix":"10.1007","author":[{"given":"Kyle E. C.","family":"Booth","sequence":"first","affiliation":[]},{"given":"Tony T.","family":"Tran","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,12]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Cook, W., Chv\u00e1tal, V.: On the solution of traveling salesman problems. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (1998)","DOI":"10.4171\/dms\/1-3\/62"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E., Toth, P.: Branch and bound methods for the traveling salesman problem. Technical report MSRR-488, DTIC Document (1983)","DOI":"10.21236\/ADA126957"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15396-9_10","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"JC Beck","year":"2010","unstructured":"Beck, J.C.: Checking-up on branch-and-check. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 84\u201398. Springer, Heidelberg (2010)"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","volume":"35","author":"B Bontoux","year":"2008","unstructured":"Bontoux, B., Feillet, D.: Ant colony optimization for the traveling purchaser problem. Comput. Oper. Res. 35(2), 628\u2013637 (2008)","journal-title":"Comput. Oper. Res."},{"key":"5_CR6","unstructured":"Burt, C.N., Lipovetzky, N., Pearce, A.R., Stuckey, P.J.: Approximate uni-directional benders decomposition. In: Proceedings of PlanSOpt-15 Workshop on Planning, Search and Optimization AAAI-15 (2015)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/978-3-642-33558-7_53","volume-title":"Principles and Practice of Constraint Programming","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., Penz, B.: A constraint programming approach for the traveling purchaser problem. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 735\u2013749. Springer, Heidelberg (2012)"},{"issue":"1","key":"5_CR8","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.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10(1), 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992\u20131009 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61\u201375 (1956)","journal-title":"Oper. Res."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theor. Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theor. Appl."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-41019-2_13","volume-title":"Computational Logistics","author":"A Goerler","year":"2013","unstructured":"Goerler, A., Schulte, F., Vo\u00df, S.: An application of late acceptance hill-climbing to the traveling purchaser problem. In: Pacino, D., Vo\u00df, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 173\u2013183. Springer, Heidelberg (2013)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.10.027","volume":"199","author":"MC Goldbarg","year":"2009","unstructured":"Goldbarg, M.C., Bagi, L.B., Goldbarg, E.F.G.: Transgenetic algorithm for the traveling purchaser problem. Eur. J. Oper. Res. 199(1), 36\u201345 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logistics (NRL) 34(3), 307\u2013318 (1987)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"1","key":"5_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1057\/jors.1986.86","volume":"37","author":"G Laporte","year":"1986","unstructured":"Laporte, G.: Generalized subtour elimination constraints and connectivity constraints. J. Oper. Res. Soc. 37, 509\u2013514 (1986)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y.: A cutting planes algorithm for the m-salesmen problem. J. Oper. Res. Soc. 31, 1017\u20131023 (1980)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"5_CR19","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","volume":"51","author":"G Laporte","year":"2003","unstructured":"Laporte, G., Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.-J.: A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper. Res. 51(6), 940\u2013951 (2003)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580682","volume":"10","author":"P Miliotis","year":"1976","unstructured":"Miliotis, P.: Integer programming approaches to the travelling salesman problem. Math. Program. 10(1), 367\u2013378 (1976)","journal-title":"Math. Program."},{"issue":"4","key":"5_CR21","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.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"issue":"1\u20133","key":"5_CR23","first-page":"78","volume":"18","author":"T Ramesh","year":"1981","unstructured":"Ramesh, T.: Traveling purchaser problem. Opsearch 18(1\u20133), 78\u201391 (1981)","journal-title":"Opsearch"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-006-0014-y","volume":"144","author":"J Riera-Ledesma","year":"2006","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.-J.: Solving the asymmetric traveling purchaser problem. Ann. Oper. Res. 144(1), 83\u201397 (2006)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","volume":"97","author":"KN Singh","year":"1997","unstructured":"Singh, K.N., van Oudheusden, D.L.: A branch and bound algorithm for the traveling purchaser problem. Eur. J. Oper. Res. 97(3), 571\u2013579 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45578-7_2","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"ES Thorsteinsson","year":"2001","unstructured":"Thorsteinsson, E.S.: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 16\u201330. Springer, Heidelberg (2001)"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","volume":"28","author":"TT Tran","year":"2016","unstructured":"Tran, T.T., Araujo, A., Beck, J.C.: Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1), 83\u201395 (2016)","journal-title":"INFORMS J. Comput."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33954-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T05:08:56Z","timestamp":1692335336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33954-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319339535","9783319339542"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33954-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}