{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:59:34Z","timestamp":1757617174637,"version":"3.44.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10479-024-06003-7","type":"journal-article","created":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T02:02:28Z","timestamp":1714960948000},"page":"993-1021","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints"],"prefix":"10.1007","volume":"351","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2377-5709","authenticated-orcid":false,"given":"Raouia","family":"Taktak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,6]]},"reference":[{"key":"6003_CR1","doi-asserted-by":"crossref","unstructured":"Borne, S., Gabrel, V., Mahjoub, A. R., & Taktak, R. (2011). Multilayer survivable optical network design. In International Conference on Network Optimization, pp. 170\u2013175. Springer.","DOI":"10.1007\/978-3-642-21527-8_22"},{"key":"6003_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.endm.2013.05.129","volume":"41","author":"S Borne","year":"2013","unstructured":"Borne, S., Mahjoub, A. R., & Taktak, R. (2013). A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints. Electronic Notes in Discrete Mathematics, 41, 487\u2013494.","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"23","key":"6003_CR3","doi-asserted-by":"publisher","first-page":"17957","DOI":"10.1007\/s00500-020-05043-y","volume":"24","author":"V Gabrel","year":"2020","unstructured":"Gabrel, V., Mahjoub, A. R., Taktak, R., & Uchoa, E. (2020). The multiple steiner tsp with order constraints: complexity and optimization algorithms. Soft Computing, 24(23), 17957\u201317968.","journal-title":"Soft Computing"},{"key":"6003_CR4","doi-asserted-by":"crossref","unstructured":"Mahjoub, A. R., Taktak, R., & Uchoa, E. (2019). A layered compact formulation for the multiple Steiner TSP with order constraints. In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 1462\u20131467. IEEE.","DOI":"10.1109\/CoDIT.2019.8820661"},{"key":"6003_CR5","doi-asserted-by":"crossref","unstructured":"Taktak, R., & Uchoa, E. (2020). On the Multiple Steiner Traveling Salesman Problem with Order Constraints. In Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4\u20136, 2020, pp. 66\u201377. Springer.","DOI":"10.1007\/978-3-030-53262-8_6"},{"key":"6003_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., & Naddef, D. (1985). The Traveling Salesman Problem on a graph and some related integer polyhedra. Mathematical Programming, 33, 1\u201327.","journal-title":"Mathematical Programming"},{"key":"6003_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480193259813","volume":"10","author":"M Ba\u00efou","year":"2002","unstructured":"Ba\u00efou, M., & Mahjoub, A. R. (2002). Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM J. Discrete Math., 10, 505\u2013514.","journal-title":"SIAM J. Discrete Math."},{"key":"6003_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0377-2217(02)00359-4","volume":"147","author":"JJ Salazar-Gonz\u00e1lez","year":"2003","unstructured":"Salazar-Gonz\u00e1lez, J. J. (2003). The Steiner cycle polytope. European Journal of Operational Research, 147, 671\u2013679.","journal-title":"European Journal of Operational Research"},{"issue":"6+","key":"6003_CR9","first-page":"1349","volume":"29","author":"M Steinov\u00e1","year":"2012","unstructured":"Steinov\u00e1, M. (2012). Approximability of the minimum Steiner cycle problem. Computing and Informatics, 29(6+), 1349\u20131357.","journal-title":"Computing and Informatics"},{"issue":"1","key":"6003_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejor.2013.01.044","volume":"228","author":"AN Letchford","year":"2013","unstructured":"Letchford, A. N., Nasiri, S. D., & Theis, D. O. (2013). Compact formulations of the Steiner Traveling Salesman Problem and related problems. European Journal of Operational Research, 228(1), 83\u201392.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6003_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2015.02.044","volume":"245","author":"AN Letchford","year":"2015","unstructured":"Letchford, A. N., & Nasiri, S. D. (2015). The Steiner Travelling Salesman Problem with correlated costs. European Journal of Operational Research, 245(1), 62\u201369.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"6003_CR12","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1111\/itor.12419","volume":"24","author":"R Interian","year":"2017","unstructured":"Interian, R., & Ribeiro, C. C. (2017). A GRASP heuristic using path-relinking and restarts for the Steiner Traveling Salesman Problem. International Transactions in Operational Research, 24(6), 1307\u20131323.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"6003_CR13","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2019.04.047","volume":"278","author":"J Rodr\u00edguez-Pereira","year":"2019","unstructured":"Rodr\u00edguez-Pereira, J., Fern\u00e1ndez, E., Laporte, G., Benavent, E., & Mart\u00ednez-Sykora, A. (2019). The Steiner Travelling Salesman Problem problem and its extensions. European Journal of Operational Research, 278(2), 615\u2013628.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6003_CR14","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1111\/itor.12592","volume":"26","author":"E \u00c1lvarez-Miranda","year":"2019","unstructured":"\u00c1lvarez-Miranda, E., & Sinnl, M. (2019). A note on computational aspects of the Steiner Travelling Salesman Problem. International Transactions in Operational Research, 26(4), 1396\u20131401.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"6003_CR15","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2016.05.008","volume":"254","author":"RC Andrade","year":"2016","unstructured":"Andrade, R. C. (2016). New formulations for the elementary shortest-path problem visiting a given set of nodes. European Journal of Operational Research, 254(3), 755\u2013768.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6003_CR16","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1002\/net.21778","volume":"70","author":"L Martins","year":"2017","unstructured":"Martins, L., Gomes, T., & Tipper, D. (2017). Efficient heuristics for determining node-disjoint path pairs visiting specified nodes. Networks, 70(4), 292\u2013307.","journal-title":"Networks"},{"issue":"1","key":"6003_CR17","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10878-021-00757-7","volume":"43","author":"A \u0106usti\u0107","year":"2022","unstructured":"\u0106usti\u0107, A., & Lendl, S. (2022). The Steiner cycle and path cover problem on interval graphs. Journal of combinatorial optimization, 43(1), 226\u2013234.","journal-title":"Journal of combinatorial optimization"},{"key":"6003_CR18","doi-asserted-by":"crossref","unstructured":"Cheikhrouhou, O., & Khoufi, I. (2021). A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy. Computer Science Review, 40.","DOI":"10.1016\/j.cosrev.2021.100369"},{"issue":"3","key":"6003_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, 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":"6003_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-011-1024-y","volume":"207","author":"E Benavent","year":"2013","unstructured":"Benavent, E., & Mart\u00ednez, A. (2013). Multi-depot multiple TSP: a polyhedral study and computational results. Annals of Operations Research, 207(1), 7\u201325.","journal-title":"Annals of Operations Research"},{"key":"6003_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cor.2015.12.014","volume":"70","author":"K Sundar","year":"2016","unstructured":"Sundar, K., & Rathinam, S. (2016). Generalized multiple depot Multiple Traveling Salesmen Problem\u2013polyhedral study and exact algorithm. Computers & Operations Research, 70, 39\u201355.","journal-title":"Computers & Operations Research"},{"key":"6003_CR22","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","volume":"64","author":"H Zhou","year":"2018","unstructured":"Zhou, H., Song, M., & Pedrycz, W. (2018). A comparative study of improved GA and PSO in solving multiple traveling salesmen problem. Applied Soft Computing, 64, 564\u2013580.","journal-title":"Applied Soft Computing"},{"key":"6003_CR23","doi-asserted-by":"publisher","first-page":"105192","DOI":"10.1016\/j.cor.2020.105192","volume":"129","author":"K Karabulut","year":"2021","unstructured":"Karabulut, K., \u00d6ztop, H., Kandiller, L., & Tasgetiren, M. F. (2021). Modeling and optimization of Multiple Traveling Salesmen Problems: An evolution strategy approach. Computers & Operations Research, 129, 105192.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6003_CR24","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/net.22125","volume":"80","author":"R Bernardino","year":"2022","unstructured":"Bernardino, R., Gouveia, L., Paias, A., & Santos, D. (2022). The multi-depot family Traveling Salesman Problem and clustered variants: Mathematical formulations and branch- &-cut based methods. Networks, 80(4), 502\u2013571.","journal-title":"Networks"},{"issue":"13","key":"6003_CR25","doi-asserted-by":"publisher","first-page":"3014","DOI":"10.3390\/math11133014","volume":"11","author":"JA Cornejo-Acosta","year":"2023","unstructured":"Cornejo-Acosta, J. A., Garc\u00eda-D\u00edaz, J., P\u00e9rez-Sansalvador, J. C., & Segura, C. (2023). Compact Integer Programs for Depot-free Multiple Traveling Salesperson Problems. Mathematics, 11(13), 3014.","journal-title":"Mathematics"},{"key":"6003_CR26","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu, X., Yuan, H., Liptrott, M., & Trovati, M. (2018). Two phase heuristic algorithm for the Multiple-Travelling Salesman Problem. Soft Computing, 22, 6567\u20136581.","journal-title":"Soft Computing"},{"key":"6003_CR27","doi-asserted-by":"publisher","first-page":"106244","DOI":"10.1016\/j.knosys.2020.106244","volume":"204","author":"Y Hu","year":"2020","unstructured":"Hu, Y., Yao, Y., & Lee, W. S. (2020). A Reinforcement Learning approach for optimizing multiple Traveling Salesman Problems over graphs. Knowledge-Based Systems, 204, 106244.","journal-title":"Knowledge-Based Systems"},{"key":"6003_CR28","unstructured":"Park, J., Kwon, C., & Park, J. (2023). Learn to solve the min-max Multiple Traveling Salesmen Problem with Reinforcement Learning. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, pp. 878\u2013886."},{"key":"6003_CR29","unstructured":"Pereira, V. N., San Felice, M. C., Hokama, P. H. D., & Xavier, E. C. (2018). The Steiner multi cycle problem with applications to a collaborative truckload problem. In 17th International Symposium on Experimental Algorithms (SEA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"6003_CR30","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2020.06.022","volume":"835","author":"CN Lintzmayer","year":"2020","unstructured":"Lintzmayer, C. N., Miyazawa, F. K., Moura, P. F., & Xavier, E. C. (2020). Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. Theoretical computer science, 835, 134\u2013155.","journal-title":"Theoretical computer science"},{"key":"6003_CR31","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1007\/s10878-021-00720-6","volume":"41","author":"H Liu","year":"2021","unstructured":"Liu, H., Zhang, H., & Xu, Y. (2021). The m-Steiner Traveling Salesman Problem with online edge blockages. Journal of Combinatorial Optimization, 41, 844\u2013860.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6003_CR32","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01585767","volume":"68","author":"E Balas","year":"1995","unstructured":"Balas, E., Fischetti, M., & Pulleyblank, W. R. (1995). The precedence-constrained asymmetric Traveling Salesman polytope. Mathematical Programming, 68, 241\u2013265.","journal-title":"Mathematical Programming"},{"key":"6003_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., & Reinelt, G. (2000). A Branch & Cut algorithm for the asymmetric Traveling Salesman Problem with precedence constraints. Computational Optimization and Applications, 17, 61\u201384.","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"6003_CR34","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/net.20122","volume":"48","author":"L Gouveia","year":"2006","unstructured":"Gouveia, L., & Pesneau, P. (2006). On extended formulations for the precedence constrained asymmetric Traveling Salesman Problem. Networks, 48(2), 77\u201389.","journal-title":"Networks"},{"issue":"4","key":"6003_CR35","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/net.21765","volume":"71","author":"L Gouveia","year":"2018","unstructured":"Gouveia, L., Pesneau, P., Ruthmair, M., & Santos, D. (2018). Combining and projecting flow models for the (precedence constrained) asymmetric Traveling Salesman Problem. Networks, 71(4), 451\u2013465.","journal-title":"Networks"},{"key":"6003_CR36","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2014.05.014","volume":"51","author":"SC Sarin","year":"2014","unstructured":"Sarin, S. C., Sherali, H. D., Judd, J. D., & Tsai, P.-F.J. (2014). Multiple asymmetric Traveling Salesmen Problem with and without precedence constraints: Performance comparison of alternative formulations. Computers & Operations Research, 51, 64\u201389.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"6003_CR37","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin, S. C., Sherali, H. D., & Bhootra, A. (2005). New tighter polynomial length formulations for the asymmetric Traveling Salesman Problem with and without precedence constraints. Operations research letters, 33(1), 62\u201370.","journal-title":"Operations research letters"},{"issue":"2","key":"6003_CR38","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2023.01.039","volume":"309","author":"D Khachai","year":"2023","unstructured":"Khachai, D., Sadykov, R., Battaia, O., & Khachay, M. (2023). Precedence constrained generalized Traveling Salesman Problem: Polyhedral study, formulations, and branch-and-cut algorithm. European Journal of Operational Research, 309(2), 488\u2013505.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"6003_CR39","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"AR Mahjoub","year":"1994","unstructured":"Mahjoub, A. R. (1994). Two edge connected spanning subgraphs and polyhedra. Mathematical Programming, 64(1\u20133), 199\u2013208.","journal-title":"Mathematical Programming"},{"issue":"1","key":"6003_CR40","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali, F., Diarrassouba, I., Mahjoub, A. R., Didi Biha, M., & Mailfert, J. (2010). A Branch-and-Cut algorithm for the k-edge connected subgraph problem. Networks, 55(1), 13\u201332.","journal-title":"Networks"},{"issue":"2","key":"6003_CR41","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D Huygens","year":"2004","unstructured":"Huygens, D., Mahjoub, A., & Pesneau, P. (2004). Two edge-disjoint hop-constrained paths and polyhedra. SIAM Journal on Discrete Mathematics, 18(2), 287\u2013312.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"6003_CR42","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ro:2008022","volume":"42","author":"AR Mahjoub","year":"2008","unstructured":"Mahjoub, A. R., & Pesneau, P. (2008). On the Steiner 2-edge connected subgraph polytope. RAIRO - Operations Research, 42(3), 259\u2013283.","journal-title":"RAIRO - Operations Research"},{"issue":"4","key":"6003_CR43","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R. E., & Hu, T. C. (1961). Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4), 551\u2013570.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"1","key":"6003_CR44","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 of Computing, 19(1), 143\u2013155.","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"6003_CR45","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"issue":"4","key":"6003_CR46","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 Association for Computing Machinery, 35(4), 921\u2013940.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"6003_CR47","doi-asserted-by":"crossref","unstructured":"Mahjoub, A. R., Taktak, R., & Uchoa, E. (2024). The Multiple Steiner TSP with Cyclic Order on terminals: valid inequalities and polyhedra.","DOI":"10.1007\/s10878-025-01288-1"},{"key":"6003_CR48","doi-asserted-by":"crossref","unstructured":"McCormick, S. T. (2008). Submodular function minimization. In Elsevier, K., Aardal, G., Nemhauser, & Weismantel, R (Eds.), The Handbook on Discrete Optimization. 321-391.","DOI":"10.1016\/S0927-0507(05)12007-6"},{"issue":"1","key":"6003_CR49","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10107-006-0084-2","volume":"112","author":"S Iwata","year":"2008","unstructured":"Iwata, S. (2008). Submodular function minimization. Mathematical Programming, 112(1), 45\u201364.","journal-title":"Mathematical Programming"},{"issue":"2","key":"6003_CR50","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2), 169\u2013197.","journal-title":"Combinatorica"},{"issue":"2","key":"6003_CR51","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80(2), 346\u2013355.","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"6003_CR52","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., & Fujishige, S. (2001). A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM), 48(4), 761\u2013777.","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"6003_CR53","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"WH Cunningham","year":"1985","unstructured":"Cunningham, W. H. (1985). On submodular function minimization. Combinatorica, 5(3), 185\u2013192.","journal-title":"Combinatorica"},{"issue":"2","key":"6003_CR54","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J. B. (2009). A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming, 118(2), 237\u2013251.","journal-title":"Mathematical Programming"},{"key":"6003_CR55","doi-asserted-by":"crossref","unstructured":"Iwata, S., & Orlin, J. B. (2009). A simple combinatorial algorithm for submodular function minimization. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1230\u20131237. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973068.133"},{"key":"6003_CR56","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"MW Padberg","year":"1991","unstructured":"Padberg, M. W., & Rinaldi, G. (1991). A Branch-and-Cut algorithm for the resolution of large-scale symmetric Traveling Salesman Problems. SIAM Review, 33, 60\u2013100.","journal-title":"SIAM Review"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06003-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:20:59Z","timestamp":1757118059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06003-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,6]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6003"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06003-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,5,6]]},"assertion":[{"value":"22 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2024","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 author declares that she has no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}