{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:00:39Z","timestamp":1776070839675,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,15]],"date-time":"2006-12-15T00:00:00Z","timestamp":1166140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0054-8","type":"journal-article","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T13:02:19Z","timestamp":1166101339000},"page":"3-20","source":"Crossref","is-referenced-by-count":79,"title":["Optimizing over the first Chv\u00e1tal closure"],"prefix":"10.1007","volume":"110","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,15]]},"reference":[{"key":"54_CR1","unstructured":"Achterberg, T., Koch, T., Martin, A.: The mixed integer programming library: MIPLIB 2003, http:\/\/www.miplib.zib.de (2003)"},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"Balas E. (1989). The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM J. Discrete Math. 2: 425\u2013451","journal-title":"SIAM J. Discrete Math."},{"key":"54_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E. and Fischetti M. (1993). A lifting procedure for the Asymmetric Traveling Salesman Polytope and a large new class of facets. Math. Program. 58: 325\u2013352","journal-title":"Math. Program."},{"key":"54_CR4","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure, Technical Report 2006-E5, Tepper School of Business, CMU (2005)"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Bonami, P., Cornuejols, G., Dash, S., Fischetti, M., Lodi, A.: Projected Chvatal-Gomory cuts for mixed integer linear programs. Technical Report 2006-E4, Tepper School of Business, CMU, to appear Math. Program. (in press)","DOI":"10.1007\/s10107-006-0051-y"},{"key":"54_CR6","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0, http:\/\/www.caam. rice.edu\/~bixby\/miplib\/miplib.html"},{"key":"54_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara A. and Letchford A.N. (2003). On the separation of split cuts and related inequalities. Math. Program. 94: 279\u2013294","journal-title":"Math. Program."},{"key":"54_CR8","unstructured":"Christof, T., L\u00f6bel, A.: PORTA - POlyhedron representation transformation algorithm, http:\/\/www.zib.de\/Optimization\/Software\/Porta\/"},{"key":"54_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V. (1973). Edmonds polytopes and a hierarchy of combinatorial problems.. Discrete Math. 4: 305\u2013337","journal-title":"Discrete Math."},{"key":"54_CR10","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: On the MIR closure of polyhedra. IBM, T.J. Watson Research, Working paper, (2005)"},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J. (1965). Maximum matching and a polyhedron with {0,1}-vertices. J. Res. Nat. Bur. Stand. B 69: 125\u2013130","journal-title":"J. Res. Nat. Bur. Stand. B"},{"key":"54_CR12","first-page":"89","volume-title":"Combinatorial Structures and their Applications.","author":"J. Edmonds","year":"1970","unstructured":"Edmonds J. and Johnson H.L. (1970). Matching: a well-solved class of integer linear programs. In: Guy, R.K. (eds) Combinatorial Structures and their Applications., pp 89\u201392. Gordon and Breach, New York"},{"key":"54_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand F. (1999). On the membership problem for the elementary closure of a polyhedron. Combinatorica 19: 297\u2013300","journal-title":"Combinatorica"},{"key":"54_CR14","first-page":"12","volume-title":"Integer programming and combinatorial optimization\u2014IPCO 2005, LNCS 3509","author":"M. Fischetti","year":"2005","unstructured":"Fischetti M. and Lodi A. (2005). Optimizing over the first Chv\u00e1tal closure. In: J\u00fcnger, M. and Kaibel, V. (eds) Integer programming and combinatorial optimization\u2014IPCO 2005, LNCS 3509, pp 12\u201322. Springer, Berlin Heidelberg New York"},{"key":"54_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory R.E. (1958). Outline of an algorithm for integer solutions to linear programs. Bull. AMS 64: 275\u2013278","journal-title":"Bull. AMS"},{"key":"54_CR16","first-page":"275","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory R.E. (1963). An algorithm for integer solutions to linear programs. In: Graves, R.L. and Wolfe, P. (eds) Recent Advances in Mathematical Programming, pp 275. McGraw-Hill, New York"},{"key":"54_CR17","unstructured":"ILOG Cplex 9.1: User\u2019s manual and reference manual, ILOG, S.A. http:\/\/www.ilog.com\/(2005)"},{"key":"54_CR18","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-540-25960-2_15","volume-title":"Integer programming and combinatorial optimization\u2014IPCO 2004, LNCS 3064","author":"A.N. Letchford","year":"2004","unstructured":"Letchford A.N., Reinelt G. and Theis D.O. (2004). A faster exact separation algorithm for blossom inequalities. In: Bienstock, D. and Nemhauser, G. (eds) Integer programming and combinatorial optimization\u2014IPCO 2004, LNCS 3064, pp 196\u2013205. Springer, Berlin Heidelberg New York"},{"key":"54_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. Wiley, New York"},{"key":"54_CR20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"Padberg M.W. and Rao M.R. (1982). Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7: 67\u201380","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0054-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0054-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0054-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T00:04:40Z","timestamp":1707437080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0054-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0054-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,15]]}}}