{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:08:24Z","timestamp":1764655704708},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_15","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"196-205","source":"Crossref","is-referenced-by-count":26,"title":["A Faster Exact Separation Algorithm for Blossom Inequalities"],"prefix":"10.1007","author":[{"given":"Adam N.","family":"Letchford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"221","volume":"74","author":"A. Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: {0, $\\frac{1}{2}$ }-Chv\u00e1tal-Gomory cuts. Math. Program\u00a074, 221\u2013235 (1996)","journal-title":"Math. Program"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. J. Res. Nat. Bur. Standards\u00a069B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"15_CR3","first-page":"921","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. of the A.C.M.\u00a035, 921\u2013940 (1988)","journal-title":"J. of the A.C.M."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. SIAM J. Applied Math.\u00a09, 551\u2013570 (1961)","journal-title":"SIAM J. Applied Math."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02239975","volume":"39","author":"M. Gr\u00f6tschel","year":"1987","unstructured":"Gr\u00f6tschel, M., Holland, O.: A cutting plane algorithm for minimum perfect 2-matching. Computing\u00a039, 327\u2013344 (1987)","journal-title":"Computing"},{"key":"15_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.J.: Geometric Algorithms and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"15_CR7","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.W.: On the symmetric travelling salesman problem I: inequalities. Math. Program.\u00a016, 265\u2013280 (1979)","journal-title":"Math. Program."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: On the symmetric travelling salesman problem II: lifting theorems and facets. Math. Program.\u00a016, 281\u2013302 (1979)","journal-title":"Math. Program."},{"key":"15_CR9","unstructured":"Letchford, A.N., Reinelt, G., Theis, D.O.: Odd minimum cut-sets and b-matchings revisited (in preparation)"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res.\u00a07, 67\u201380 (1982)","journal-title":"Math. Oper. Res."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M.W. Padberg","year":"1987","unstructured":"Padberg, M.W., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper. Res. Lett.\u00a06, 1\u20137 (1987)","journal-title":"Oper. Res. Lett."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"Padberg, M.W., Rinaldi, G.: Facet identification for the symmetric traveling salesman polytope. Math. Program.\u00a047, 219\u2013257 (1990)","journal-title":"Math. Program."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Pulleyblank, W.R.: Faces of matching polyhedra. Ph.D thesis, University of Waterloo (1973)","DOI":"10.1007\/BFb0066196"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:00:43Z","timestamp":1605762043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}