{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:47Z","timestamp":1781345747790,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf01588786","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:19:53Z","timestamp":1114676393000},"page":"163-187","source":"Crossref","is-referenced-by-count":27,"title":["Optimizing over the subtour polytope of the travelling salesman problem"],"prefix":"10.1007","volume":"49","author":[{"given":"S. C.","family":"Boyd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","first-page":"267","volume-title":"Proceedings of the Princeton Symposium on Mathematical Programming","author":"M.L. Balinski","year":"1970","unstructured":"M.L. Balinski, \u201cOn recent developments in integer programming,\u201d in: H.W. Kuhn, ed.,Proceedings of the Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, NJ, 1970) pp. 267\u2013302."},{"key":"CR2","unstructured":"S.C. Boyd and W.R. Pulleyblank, \u201cFacet generation techniques,\u201d in preparation."},{"key":"CR3","first-page":"131","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"N. Christofides, \u201cThe travelling salesman problem,\u201d in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi, eds,Combinatorial Optimization (Wiley, New York, 1979) pp. 131\u2013149."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, \u201cEdmonds polytopes and a hierarchy of combinatorial problems,\u201dDiscrete Mathematics 4 (1973) 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, \u201cEdmonds polytopes and weakly hamiltonian graphs,\u201dMathematical Programming 5 (1973) 29\u201340.","journal-title":"Mathematical Programming"},{"key":"CR6","volume-title":"\u201cOn cutting plane proofs in combinatorial optimization,\u201d Rutcor Research Report 27\u201388","author":"V. Chv\u00e1tal","year":"1988","unstructured":"V. Chv\u00e1tal, W. Cook and M. Hartmann, \u201cOn cutting plane proofs in combinatorial optimization,\u201d Rutcor Research Report 27\u201388, Rutgers University (New Brunswick, NJ, 1988)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"G. Cornu\u00e9jols, J. Fonlupt and D. Naddef, \u201cThe traveling salesman problem on a graph and some related integer polyhedra,\u201dMathematical Programming 33 (1985) 1\u201327.","journal-title":"Mathematical Programming"},{"key":"CR8","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, \u201cSolutions of a large-scale travelling salesman problem,\u201dOperations Research 2 (1954) 393\u2013410.","journal-title":"Operations Research"},{"key":"CR9","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu, \u201cMultiterminal network flows,\u201dJournal of SIAM 9 (1961) 551\u2013570.","journal-title":"Journal of SIAM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","volume":"12","author":"M. Gr\u00f6tschel","year":"1980","unstructured":"M. Gr\u00f6tschel, \u201cOn the symmetric travelling salesman problem: solution of a 120-city problem,\u201dMathematical Programming Study 12 (1980) 61\u201377.","journal-title":"Mathematical Programming Study"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M.W. Padberg, \u201cOn the symmetric travelling salesman problem I: inequalities,\u201dMathematical Programming 16, (1979) 265\u2013280.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M.W. Padberg, \u201cOn the symmetric travelling salesman problem II: lifting theorems and facets,\u201dMathematical Programming 16, (1979) 281\u2013302.","journal-title":"Mathematical Programming"},{"key":"CR14","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cPolyhedral theory\u201d, in: E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys, eds.,The Traveling Salesman Problem (Wiley, New York, 1985)."},{"key":"CR15","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cPolyhedral computations,\u201d in: E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys, eds.,The Traveling Salesman Problem (Wiley, New York, 1985)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank, \u201cClique tree inequalities and the symmetric travelling salesman problem,\u201dMathematics of Operations Research 11 (1986) 537\u2013569.","journal-title":"Mathematics of Operations Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, \u201cThe travelling salesman problem and minimum spanning trees,\u201dOperations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR18","first-page":"1","volume-title":"Proceedings of the Twenty-first Annual Symposium on the Foundations of Computer Science","author":"R. Karp","year":"1980","unstructured":"R. Karp and C. Papadimitriou, \u201cOn linear characterizations of combinatorial optimization problems,\u201dProceedings of the Twenty-first Annual Symposium on the Foundations of Computer Science (IEEE Press, New York, 1980) pp. 1\u20139."},{"key":"CR19","volume-title":"\u201cOrdered colouring,\u201d Research Report CORR 88-39","author":"M. Katchalski","year":"1988","unstructured":"M. Katchalski, W. McQuaig and S. Seager, \u201cOrdered colouring,\u201d Research Report CORR 88-39, Department of Combinatorics and Optimization, University of Waterloo (Waterloo, Ont., 1988)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","volume":"12","author":"M.W. Padberg","year":"1980","unstructured":"M.W. Padberg and S. Hong, \u201cOn the symmetric travelling salesman problem: a combinatorial study,\u201dMathematical Programming Study 12 (1980) 78\u2013107.","journal-title":"Mathematical Programming Study"},{"key":"CR21","first-page":"511","volume":"17","author":"M. Padberg","year":"1983","unstructured":"M. Padberg and L.A. Wolsey, \u201cTrees and cuts\u201d,Annals of Discrete Mathematics 17 (1983) 511\u2013517.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR22","volume-title":"Faces of Matching Polyhedra","author":"W.R. Pulleyblank","year":"1973","unstructured":"W.R. Pulleyblank, \u201cFaces of Matching Polyhedra,\u201d Doctoral Thesis, University of Waterloo (Waterloo, Ont., 1973)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588786.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588786\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:27Z","timestamp":1556883387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588786"],"URL":"https:\/\/doi.org\/10.1007\/bf01588786","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}