{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:39Z","timestamp":1725856959959},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_32","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"387-397","source":"Crossref","is-referenced-by-count":5,"title":["Deciding Emptiness of the Gomory-Chv\u00e1tal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on positive integral solutions to linear Diophantine equations. Proc. Am. Math. Soc. 55, 299\u2013304 (1976)","journal-title":"Proc. Am. Math. Soc."},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.orl.2009.06.006","volume":"37","author":"M Campelo","year":"2009","unstructured":"Campelo, M., Cornu\u00e9jols, G.: Stable sets, corner polyhedra and the Chv\u00e1tal closure. Oper. Res. Lett. 37, 375\u2013378 (2009)","journal-title":"Oper. Res. Lett."},{"key":"32_CR3","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.: Edmonds polytope and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"32_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Switzerland (2014)"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stan. B 69, 125\u2013130 (1965)","journal-title":"J. Res. Natl. Bur. Stan. B"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"key":"32_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"AMH Gerards","year":"1986","unstructured":"Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica 6, 365\u2013379 (1986)","journal-title":"Combinatorica"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"32_CR12","unstructured":"Lueker, G.S.: Two NP-complete Problems in Non-negative Integer Programming. Report No. 178, Department of Computer Science, Princeton University, Princeton, N.J. (1975)"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"2181","DOI":"10.1137\/080737587","volume":"20","author":"A Mahajan","year":"2010","unstructured":"Mahajan, A., Ralphs, T.: On the complexity of selecting disjunctions in integer programming. SIAM J. Optim. 20, 2181\u20132198 (2010)","journal-title":"SIAM J. Optim."},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"MW Padberg","year":"1982","unstructured":"Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and $$b$$ -matchings. Math. Oper. Res. 7, 67\u201380 (1982)","journal-title":"Math. Oper. Res."},{"key":"32_CR15","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"}],"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-319-33461-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T10:52:01Z","timestamp":1498301521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}