{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:08:32Z","timestamp":1778677712534,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1007\/bf02592196","type":"journal-article","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:18:08Z","timestamp":1177978688000},"page":"221-235","source":"Crossref","is-referenced-by-count":88,"title":["{0, 1\/2}-Chv\u00e1tal-Gomory cuts"],"prefix":"10.1007","volume":"74","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF02592196_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"E. Balas, \u201cThe asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph\u201d,SIAM Journal on Discrete Mathematics 2 (4) (1989) 425\u2013451.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02592196_CR2","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1090\/S0002-9939-1965-0180568-2","volume":"16","author":"P. Camion","year":"1965","unstructured":"P. Camion, \u201cCharacterizations of totally unimodular matrices,\u201dProceedings of the American Mathematical Society 16 (1965) 1068\u20131073.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"BF02592196_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"S. Chopra and M.R. Rao, \u201cThe partition problem\u201d,Mathematical Programming 59 (1993) 87\u2013115.","journal-title":"Mathematical Programming"},{"key":"BF02592196_CR4","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornu\u00e9jols","year":"1990","unstructured":"G. Cornu\u00e9jols, G.L., Nemhauser and L.A. Wolsey, \u201cThe uncapacitated facility location problem\u201d, in: P.B. Mirchandani and R.L. Francis, eds.,Discrete Location Theory (Wiley, New York, 1990) pp. 119\u2013171."},{"issue":"4","key":"BF02592196_CR5","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/moor.17.4.981","volume":"17","author":"M. Deza","year":"1992","unstructured":"M. Deza, M. Gr\u00f6tschel and M. Laurent \u201cClique-web facets for multicut polytopes,\u201dMathematics of Operations Research 17 (4) (1992) 981\u20131000.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592196_CR6","first-page":"125","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0.1-vertices,\u201dJournal of Research of the National Bureau of Standards B. Mathematics and Mathematical Physics 69 (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards B. Mathematics and Mathematical Physics"},{"key":"BF02592196_CR7","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and H.L. Johnson, \u201cMatching: a well-solved class of integer linear programs,\u201d in: R.K. Guy et al., eds.Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"BF02592196_CR8","unstructured":"M. Fischetti and P. Toth, \u201cA polyhedral approach for solving hard ATSP instances,\u201d Working paper, University of Bologna (1994)."},{"key":"BF02592196_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979)."},{"issue":"4","key":"BF02592196_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A.M.H. Gerards","year":"1986","unstructured":"A.M.H. Gerards and A. Schrijver, \u201cMatrices with the Edmonds-Johnson property,\u201dCombinatorica 6(4) (1986) 365\u2013379.","journal-title":"Combinatorica"},{"key":"BF02592196_CR11","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cA cutting plane algorithm for the linear ordering problem\u201d,Operations Research 32 (1984) 1195\u20131220.","journal-title":"Operations Research"},{"key":"BF02592196_CR12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOn the acyclic subgraph polytope,\u201dMathematical Programming 33 (1985) 28\u201342.","journal-title":"Mathematical Programming"},{"key":"BF02592196_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cFacets of the linear ordering polytope,\u201dMathematical Programming 33, (1985) 43\u201360.","journal-title":"Mathematical Programming"},{"key":"BF02592196_CR14","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":"BF02592196_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank, \u201cWeakly bipartite graphs and the max-cut problem,\u201dOperations Research Letters 1 (1981) 23\u201327.","journal-title":"Operations Research Letters"},{"key":"BF02592196_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi, \u201cFacets of the clique partitioning polytope,\u201dMathematical Programming 47 (1990) 367\u2013387.","journal-title":"Mathematical Programming"},{"key":"BF02592196_CR17","unstructured":"R. M\u00fcller, \u201cOn the transitive acyclic subdigraph polytope,\u201d in: G. Rinaldi and L.A. Wolsey, eds.,Proceedings of Third IPCO Conference (1993) pp. 463\u2013477."},{"key":"BF02592196_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization, Wiley, New York, (1988)."},{"issue":"1","key":"BF02592196_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"M.W. Padberg and M.R. Rao \u201cOdd minimum cut-sets andb-matchings,\u201dMathematics of Operations Research 7 (1) (1982) 67\u201380.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592196_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."},{"key":"BF02592196_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"P.D. Seymour, \u201cDecomposition of regular matroids,\u201dJournal of Combinatorial Theory B 28 (1980) 305\u2013359.","journal-title":"Journal of Combinatorial Theory B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592196.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592196\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:53Z","timestamp":1558381073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF02592196"],"URL":"https:\/\/doi.org\/10.1007\/bf02592196","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}