{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:56:06Z","timestamp":1742993766419,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_13","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"131-136","source":"Crossref","is-referenced-by-count":2,"title":["On Counting Lattice Points and Chv\u00e1tal-Gomory Cutting Planes"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Lodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2008","unstructured":"Achterberg, T.: SCIP: Solving Constraint Integer Programs. Mathematical Programming Computation\u00a01, 1\u201332 (2008)","journal-title":"Mathematical Programming Computation"},{"key":"13_CR2","unstructured":"Achterberg, T.: LP Basis Selection and Cutting Planes. Research Talk @ MIP (2010), \n                    http:\/\/www2.isye.gatech.edu\/mip2010\/program\/program.pdf"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G. Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding $\\{0,\\frac{1}{2}\\}$-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS Journal on Computing\u00a019, 229\u2013238 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.: Gomory Cuts Revisited. Operations Research Letters\u00a019, 1\u20139 (1996)","journal-title":"Operations Research Letters"},{"key":"13_CR5","unstructured":"Caprara, A., Lodi, A., Scheinberg, K. (eds.): Counting and Estimating Lattice Points. Optima, vol.\u00a0(81), \n                    http:\/\/www.mathprog.org\/Optima-Issues\/optima81.pdf"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"13_CR7","unstructured":"Dunkel, J.: On Gomory-Chv\u00e1tal Cutting Planes, the Elementary Closure, and a Strengthened Closure for Polytopes in the Unit Cube. PhD thesis. MIT, Cambridge, MA (2011)"},{"key":"13_CR8","doi-asserted-by":"publisher","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\u00a019, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the AMS\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the AMS"},{"key":"13_CR10","first-page":"3239","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"J.T. Linderoth","year":"2011","unstructured":"Linderoth, J.T., Lodi, A.: MILP Software. In: Cochran, J.J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, vol.\u00a05, pp. 3239\u20133248. Wiley, Chichester (2011)"},{"key":"13_CR11","first-page":"619","volume-title":"50 Years of Integer Programming 1958-2008","author":"A. Lodi","year":"2009","unstructured":"Lodi, A.: MIP computation. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 619\u2013645. Springer, Heidelberg (2009)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-68155-7_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Pesant","year":"2008","unstructured":"Pesant, G., Quimper, C.-G.: Counting solutions of knapsack constraints. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 203\u2013217. Springer, Heidelberg (2008)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"M.A. Trick","year":"2003","unstructured":"Trick, M.A.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Annals of Operations Research\u00a0118, 73\u201384 (2003)","journal-title":"Annals of Operations Research"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.cor.2010.10.025","volume":"38","author":"J. Pryor","year":"2011","unstructured":"Pryor, J., Chinneck, J.W.: Faster Integer-Feasibility in Mixed-Integer Linear Programs by Branching to Force Change. Computers & OR\u00a038, 1143\u20131152 (2011)","journal-title":"Computers & OR"},{"key":"13_CR15","unstructured":"Wesselmann, F., Suhl, U.H.: Implementation techniques for cutting plane management and selection. Technical Report Universit\u00e4t Paderborn (2007)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A. Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints\u00a014, 392\u2013413 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:03:03Z","timestamp":1609203783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}