{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:49Z","timestamp":1751282869312},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:16:27Z","timestamp":1330258587000},"page":"438-451","source":"Crossref","is-referenced-by-count":13,"title":["Combining and strengthening Gomory cuts"],"prefix":"10.1007","author":[{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Dawande","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S. and Cornu\u00e9jols, G. (1993), A lift-and-project cutting plane algorithm for mixed 0\u20131 programs, Mathematical Programming, 58, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"35_CR2","volume-title":"Management Science Research Report MSRR-603","author":"E. Balas","year":"1994","unstructured":"Balas, E., Ceria, S. and Cornu\u00e9jols, G. (1994), Mixed 0\u20131 Programming by lift-and-project in a branch-and-cut framework, Management Science Research Report MSRR-603, GSIA, Carnegie Mellon University, Pittsburgh, PA., to appear in Management Science."},{"key":"35_CR3","volume-title":"Management Science Research Report","author":"E. Balas","year":"1994","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G. and Natraj, N.R. (1994), Gomory cuts revisited, Management Science Research Report, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Boyd, E.A., and Indovina, R.R. (1992), MIPLIB: A test set of mixed integer programming problems, SIAM News 16.","DOI":"10.21236\/ADA455431"},{"key":"35_CR5","volume-title":"Ph.D. Dissertation","author":"S. Ceria","year":"1993","unstructured":"Ceria, S. (1993), Lift-and-Project Methods for Mixed 0\u20131 Programs, Ph.D. Dissertation, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"key":"35_CR6","volume-title":"Ph.D. Dissertation","author":"T.J. Chou","year":"1979","unstructured":"Chou, T.J. (1979), Algorithms for the Solution of Systems of Linear Diophantine Equations, Ph.D. Dissertation, Department of Computer Sciences, University of Wisconsin-Madison."},{"key":"35_CR7","volume-title":"Theory of Numbers","author":"L.E. Dickson","year":"1952","unstructured":"Dickson, L.E. (1952), Theory of Numbers, Chelsea Publishing Company, N.Y."},{"key":"35_CR8","unstructured":"Garfinkel, R.S. and Nemhauser, G.L. (1972), Integer Programming, John Wiley & Sons."},{"key":"35_CR9","unstructured":"Gomory, R.E. (1963), An Algorithm for Integer Solutions to Linear Programs, in Recent Advances in Mathematical Programming, Graves, R.L. and Wolfe, P. eds., 269\u2013302. (Originally appeared as Princeton-IBM Math. Res. Project Tech. Rep. No. 1, 1958.)"},{"key":"35_CR10","series-title":"Management Science Research Reports MSRR-332 & MSRR-333","volume-title":"The Principles of Cutting Plane Theory","author":"R.G. Jeroslow","year":"1974","unstructured":"Jeroslow, R.G. (1974), The Principles of Cutting Plane Theory, Parts I & II Management Science Research Reports MSRR-332 & MSRR-333, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"key":"35_CR11","volume-title":"Integer Programming","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and Wolsey, L.A. (1988), Integer Programming, Wiley, N.Y."},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1080\/00029890.1941.11991159","volume":"48","author":"J.B. Rosser","year":"1941","unstructured":"Rosser, J.B. (1941), A Note on the Linear Diophantine Equation, American Mathematical Monthly, 48, 662\u2013666.","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:27:07Z","timestamp":1605630427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}