{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:50:14Z","timestamp":1778557814595,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004837","name":"ministerio de ciencia e innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-104966GB-I00\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["PID2019-104966GB-I00\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"ministerio de ciencia e innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-104933GB-I00\/AEI\/10.13039\/501100011033"],"award-info":[{"award-number":["PID2019-104933GB-I00\/AEI\/10.13039\/501100011033"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["BES-2015-072036"],"award-info":[{"award-number":["BES-2015-072036"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["ELKARTEK"],"award-info":[{"award-number":["ELKARTEK"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["IT-1252-19"],"award-info":[{"award-number":["IT-1252-19"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003451","name":"euskal herriko unibertsitatea","doi-asserted-by":"publisher","award":["GIU20\/054"],"award-info":[{"award-number":["GIU20\/054"]}],"id":[{"id":"10.13039\/501100003451","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["BERC 2018-2021"],"award-info":[{"award-number":["BERC 2018-2021"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003086","name":"Eusko Jaurlaritza","doi-asserted-by":"publisher","award":["IT1244-19"],"award-info":[{"award-number":["IT1244-19"]}],"id":[{"id":"10.13039\/501100003086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["SEV-2017-0718"],"award-info":[{"award-number":["SEV-2017-0718"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10479-021-04210-0","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T11:02:51Z","timestamp":1627988571000},"page":"107-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms"],"prefix":"10.1007","volume":"305","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8669-4482","authenticated-orcid":false,"given":"Gorka","family":"Kobeaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda","family":"Merino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"4210_CR1","unstructured":"Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2007). The traveling salesman problem: A computational study (Princeton series in applied mathematics). Princeton University Press."},{"key":"4210_CR2","doi-asserted-by":"crossref","unstructured":"Archetti, C., Speranza, M.\u00a0G., & Vigo, D. (2014). Vehicle routing problems with profits. In Vehicle routing: Problems, methods, and applications, chapter\u00a010 (pp. 273\u2013297). MOS-SIAM Series on Optimization.","DOI":"10.1137\/1.9781611973594.ch10"},{"issue":"1","key":"4210_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1287\/moor.22.1.110","volume":"22","author":"P Bauer","year":"1997","unstructured":"Bauer, P. (1997). The circuit polytope: Facets. Mathematics of Operations Research, 22(1), 110\u2013145.","journal-title":"Mathematics of Operations Research"},{"key":"4210_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s101070100209","volume":"91","author":"P Bauer","year":"2002","unstructured":"Bauer, P., Linderoth, J., & Savelsbergh, M. (2002). A branch and cut approach to the cardinality constrained circuit problem. Mathematical Programming, 91, 307\u2013348.","journal-title":"Mathematical Programming"},{"key":"4210_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/net.20307","volume":"54","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks, 54, 56\u201367.","journal-title":"Networks"},{"key":"4210_CR6","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/0024-3795(89)90483-7","volume":"114\u2013115","author":"CR Coullard","year":"1989","unstructured":"Coullard, C. R., & Pulleyblank, W. R. (1989). On cycle cones and polyhedra. Linear Algebra and its Applications, 114\u2013115, 613\u2013640. Special Issue Dedicated to Alan J. Hoffman.","journal-title":"Linear Algebra and its Applications"},{"issue":"5","key":"4210_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H Crowder","year":"1980","unstructured":"Crowder, H., & Padberg, M. W. (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Science, 26(5), 495\u2013509.","journal-title":"Management Science"},{"issue":"2","key":"4210_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188\u2013205.","journal-title":"Transportation Science"},{"issue":"2","key":"4210_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar-Gonz\u00e1lez, J. J., & Toth, P. (1995). The symmetric generalized traveling salesman polytope. Networks, 26(2), 113\u2013123.","journal-title":"Networks"},{"key":"4210_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar-Gonz\u00e1lez, J. J., & Toth, P. (1997). A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45, 378\u2013394.","journal-title":"Operations Research"},{"key":"4210_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar-Gonz\u00e1lez, J. J., & Toth, P. (1998). Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing, 10, 133\u2013148.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"4210_CR12","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the ACM, 35(4), 921\u2013940.","journal-title":"Journal of the ACM"},{"issue":"1","key":"4210_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.2000.1136","volume":"38","author":"AV Goldberg","year":"2001","unstructured":"Goldberg, A. V., & Tsioutsiouliklis, K. (2001). Cut tree algorithms: An experimental study. Journal of Algorithms, 38(1), 51\u201383.","journal-title":"Journal of Algorithms"},{"key":"4210_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R Gomory","year":"1961","unstructured":"Gomory, R., & Hu, T. (1961). Multiterminal network flows. Journal of The Society for Industrial and Applied Mathematics, 9, 551\u2013570.","journal-title":"Journal of The Society for Industrial and Applied Mathematics"},{"issue":"1","key":"4210_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., & Holland, O. (1991). Solution of large-scale symmetric travelling salesman problems. Mathematical Programming, 51(1), 141\u2013202.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4210_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., & Padberg, M. (1979). On the symmetric travelling salesman problem I: Inequalities. Mathematical Programming, 16(1), 265\u2013280.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4210_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D Gusfield","year":"1990","unstructured":"Gusfield, D. (1990). Very simple methods for all pairs network flow analysis. SIAM Journal on Computing, 19(1), 143\u2013155.","journal-title":"SIAM Journal on Computing"},{"key":"4210_CR18","doi-asserted-by":"crossref","unstructured":"Gutin, G., & Punnen, A. P. (2007). The traveling salesman problem and its variations (combinatorial optimization). Springer.","DOI":"10.1007\/b101971"},{"key":"4210_CR19","unstructured":"Hao, J., & Orlin, J.\u00a0B. (1992). A faster algorithm for finding the minimum cut in a graph. In Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, SODA \u201992 (pp. 165\u2013174). Society for Industrial and Applied Mathematics."},{"key":"4210_CR20","unstructured":"Hong, S. (1972). A linear programming approach for the traveling salesman problem. Ph.D. thesis, Johns Hopkins University."},{"key":"4210_CR21","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disopt.2014.08.001","volume":"14","author":"MK Jepsen","year":"2014","unstructured":"Jepsen, M. K., Petersen, B., Spoorendonk, S., & Pisinger, D. (2014). A branch-and-cut algorithm for the capacitated profitable tour problem. Discrete Optimization, 14, 78\u201396.","journal-title":"Discrete Optimization"},{"key":"4210_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s004539910009","volume":"26","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Rinaldi, G., & Thienel, S. (2000). Practical performance of efficient minimum cut algorithms. Algorithmica, 26, 172\u2013195.","journal-title":"Algorithmica"},{"key":"4210_CR23","unstructured":"Kobeaga, G. (2020). gkobeaga\/cpsrksec: Preprint version."},{"key":"4210_CR24","unstructured":"Padberg, M., & Gr\u00f6tschel, M. (1985). Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, & D. B. Shimoys (Eds.), The traveling salesman problem (pp. 307\u2013360). Wiley."},{"issue":"1","key":"4210_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg, M., & Rinaldi, G. (1990a). An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, 47(1), 19\u201336.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4210_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg, M., & Rinaldi, G. (1990b). Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, 47(1), 219\u2013257.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4210_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01582894","volume":"52","author":"M Padberg","year":"1991","unstructured":"Padberg, M., & Sung, T.-Y. (1991). An analytical comparison of different formulations of the travelling salesman problem. Mathematical Programming, 52(1), 315\u2013357.","journal-title":"Mathematical Programming"},{"key":"4210_CR28","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10100-016-0437-8","volume":"25","author":"U Pferschy","year":"2017","unstructured":"Pferschy, U., & Stan\u0115k, R. (2017). Generating subtour elimination constraints for the tsp from pure integer solutions. Central European Journal of Operations Research, 25, 231\u2013260.","journal-title":"Central European Journal of Operations Research"},{"issue":"4","key":"4210_CR29","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 Journal on Computing, 3(4), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"4210_CR30","first-page":"41","volume-title":"State-of-the-art solution techniques for OP and TOP","author":"P Vansteenwegen","year":"2019","unstructured":"Vansteenwegen, P., & Gunawan, A. (2019). State-of-the-art solution techniques for OP and TOP (pp. 41\u201366). Cham: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04210-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04210-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04210-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T14:29:09Z","timestamp":1631629749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04210-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["4210"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04210-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"19 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}