{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:09:26Z","timestamp":1781003366193,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T00:00:00Z","timestamp":1455667200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P23829-N13"],"award-info":[{"award-number":["P23829-N13"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10100-016-0437-8","type":"journal-article","created":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T05:36:09Z","timestamp":1455687369000},"page":"231-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["Generating subtour elimination constraints for the TSP from pure integer solutions"],"prefix":"10.1007","volume":"25","author":[{"given":"Ulrich","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rostislav","family":"Stan\u011bk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,17]]},"reference":[{"key":"437_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg T (2009) SCIP: solving constraint integer programs. Math Progr Comput 1(1):1\u201341. http:\/\/mpc.zib.de\/index.php\/MPC\/article\/view\/4","DOI":"10.1007\/s12532-008-0001-1"},{"key":"437_CR2","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Bixby RE, Chv\u00e1tal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"437_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Math Proc Camb 55:299\u2013327","journal-title":"Math Proc Camb"},{"key":"437_CR4","unstructured":"Bosch R (2008) Connecting the dots: the ins and outs of TSP art. In: Sarhangi R, Carlo H. S\u00e9quin (eds) Bridges Leeuwarden: mathematics, music, art, architecture, culture. Southwestern College, Winfield, pp 235\u2013242"},{"issue":"5","key":"437_CR5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H Crowder","year":"1980","unstructured":"Crowder H, Padberg MW (1980) Solving large-scale symmetric travelling salesman problems to optimality. Manag Sci 26(5):495\u2013509","journal-title":"Manag Sci"},{"key":"437_CR6","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. Oper Res 2:393\u2013410","journal-title":"Oper Res"},{"key":"437_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, Holland O (1991) Solving large-scale symmetric travelling salesman problems to optimality. Math Program 51:141\u2013202","journal-title":"Math Program"},{"key":"437_CR8","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2006","unstructured":"Gutin G, Punnen A (2006) The traveling salesman problem and its variations. Springer, Berlin"},{"key":"437_CR9","unstructured":"Helsgaun K (2008) LKH\u2014version 2.0.2. www.akira.ruc.dk\/~keld\/research\/LKH\/LKH-2.0.2.tgz"},{"key":"437_CR10","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Upper Saddle River"},{"key":"437_CR11","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"E Lawler","year":"1985","unstructured":"Lawler E, Lenstra J, Rinnooy\u00a0Kan A, Shmoys D (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, New York"},{"key":"437_CR12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580682","volume":"10","author":"P Miliotis","year":"1976","unstructured":"Miliotis P (1976) Integer programming approaches to the travelling salesman problem. Math Program 10:367\u2013378","journal-title":"Math Program"},{"key":"437_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s101070100276","volume":"92","author":"D Naddef","year":"2002","unstructured":"Naddef D, Thienel S (2002) Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Math Program 92:257\u2013283","journal-title":"Math Program"},{"issue":"3","key":"437_CR14","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.cor.2007.11.008","volume":"36","author":"T \u00d6ncan","year":"2009","unstructured":"\u00d6ncan T, Kuban Alt\u0131nel \u0130, Laporte G (2009) A comparative analysis of several asymmetric traveling salesman problem formulations. Comput Oper Res 36(3):637\u2013654","journal-title":"Comput Oper Res"},{"key":"437_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg M, Rinaldi G (1990) An efficient algorithm for the minimum capacity cut problem. Math Program 47:19\u201336","journal-title":"Math Program"},{"key":"437_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random geometric graphs","author":"M Penrose","year":"2003","unstructured":"Penrose M (2003) Random geometric graphs. Oxford University Press, Oxford"},{"key":"437_CR17","unstructured":"Pferschy U, Stan\u011bk R (2015) Generating subtour elimination constraints for the TSP from pure integer solutions. Technical report. University of Graz, Department of Statistics and Operations Research. arXiv:1511.03533"},{"key":"437_CR18","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin"},{"key":"437_CR19","unstructured":"Reinelt G (1995) TSPLIB95. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"437_CR20","doi-asserted-by":"crossref","unstructured":"Rhee WT (1993) A matching problem and subadditive euclidean functionals. Ann Appl Probab 3(3):794\u2013801","DOI":"10.1214\/aoap\/1177005364"},{"key":"437_CR21","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"key":"437_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093472","volume-title":"Probability theory of classical Euclidean optimization problems","author":"JE Yukich","year":"1998","unstructured":"Yukich JE (1998) Probability theory of classical Euclidean optimization problems. Springer, Berlin"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0437-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-016-0437-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0437-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0437-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T13:43:00Z","timestamp":1567604580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-016-0437-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,17]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["437"],"URL":"https:\/\/doi.org\/10.1007\/s10100-016-0437-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,17]]}}}