{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:46:57Z","timestamp":1725475617997},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672814"},{"type":"electronic","value":"9783540464211"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720084_1","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T14:36:30Z","timestamp":1167402990000},"page":"1-17","source":"Crossref","is-referenced-by-count":4,"title":["Combining Logic and Optimization in Cutting Plane Theory"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics\u00a05, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming\u00a058, 295\u2013324 (1993)","journal-title":"Mathematical Programming"},{"issue":"9","key":"1_CR3","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0-1 programming by lift-and project in a branch-and-cut framework. Management Science\u00a042(9), 1229\u20131246 (1996)","journal-title":"Management Science"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.R.: Gomory cuts revisited. Operations Research Letters\u00a019 (1996)","DOI":"10.1016\/0167-6377(96)00007-7"},{"key":"1_CR5","series-title":"Operations Research\/ Computer Science Interfaces Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1315-1","volume-title":"Logic-based 0-1 constraint programming","author":"P. Barth","year":"1996","unstructured":"Barth, P.: Logic-based 0-1 constraint programming. Operations Research\/ Computer Science Interfaces Series. Kluwer, Dordrecht (1996)"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/4298.003.0022","volume-title":"Logic Programming. 12th International Conference, ICLP 1995","author":"P. Barth","year":"1995","unstructured":"Barth, P., Bockmayr, A.: Finite domain and cutting plane techniques in CLP(PB). In: Sterling, L. (ed.) Logic Programming. 12th International Conference, ICLP 1995, Kanagawa, Japan, pp. 133\u2013147. MIT Press, Cambridge (1995)"},{"key":"1_CR7","unstructured":"Barth, P., Bockmayr, A.: Modelling 0-1 problems in CLP(PB). In: Practical Application of Constraint Technology, PACT 1996, London, pp. 1\u20139. The Practical Application Company Ltd. (1996)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00933212","volume":"25","author":"C. Blair","year":"1978","unstructured":"Blair, C., Jeroslow, R.G.: A converse for disjunctive constraints. Journal of Optimization Theory and Applications\u00a025, 195\u2013206 (1978)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"1_CR9","unstructured":"Bockmayr, A.: Logic programming with pseudo-Boolean constraints. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming. Selected Research, ch. 18, pp. 327\u2013350. MIT Press, Cambridge (1993)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-59155-9_2","volume-title":"Constraint Programming: Basics and Trends","author":"A. Bockmayr","year":"1995","unstructured":"Bockmayr, A.: Solving pseudo-Boolean constraints. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol.\u00a0910, pp. 22\u201338. Springer, Heidelberg (1995)"},{"key":"1_CR11","unstructured":"Bockmayr, A., Eisenbrand, F.: Cutting planes and the elementary closure in fixed dimension, Research Report MPI-I-99-2-008, Max-Planck-Institut f\u00fcr Informatik, Im Stadtwald, D-66123 Saarbr\u00fccken, Germany (1999)"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","volume":"98","author":"A. Bockmayr","year":"1999","unstructured":"Bockmayr, A., Eisenbrand, F., Hartmann, M., Schulz, A.S.: On the Chv\u00e1tal rank of polytopes in the 0\/1 cube. Discrete Applied Mathematics\u00a098, 21\u201327 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033166","volume-title":"Optimization Methods for Logical Inference","author":"V. Chandru","year":"1999","unstructured":"Chandru, V., Hooker, J.N.: Optimization Methods for Logical Inference. Wiley, Chichester (1999)"},{"key":"1_CR14","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":"1_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114\/115","author":"V. Chv\u00e1tal","year":"1989","unstructured":"Chv\u00e1tal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications\u00a0114\/115, 455\u2013499 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W. Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting plane proofs. Discrete Applied Mathematics\u00a018, 25\u201338 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W. Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, E.: Sensitivity theorems in integer linear programming. Mathematical Programming\u00a034, 251\u2013264 (1986)","journal-title":"Mathematical Programming"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W. Cook","year":"1992","unstructured":"Cook, W., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica\u00a012(1), 27\u201337 (1992)","journal-title":"Combinatorica"},{"issue":"2","key":"1_CR19","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(2), 297\u2013300 (1999)","journal-title":"Combinatorica"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-48777-8_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F., Schulz, A.S.: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1 cube. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 137\u2013150. Springer, Heidelberg (1999)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Gerards, A.M.H.: On cutting planes and matrices. In: Cook, W., Seymour, P.D. (eds.) Polyhedral Combinatorics, DIMACS, pp. 29\u201332 (1990)","DOI":"10.1090\/dimacs\/001\/03"},{"key":"1_CR22","first-page":"275","volume":"AMS 64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull\u00a0AMS 64, 275\u2013278 (1958)","journal-title":"Bull"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Heidelberg (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoretical Computer Science\u00a039, 297\u2013308 (1985)","journal-title":"Theoretical Computer Science"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/jcss.1998.1617","volume":"58","author":"A. Haken","year":"1999","unstructured":"Haken, A., Cook, S.A.: An exponential lower bound for the size of monotone real circuits. Journal of Computer and System Sciences\u00a058, 326\u2013335 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0166-218X(83)90067-7","volume":"6","author":"A.C. Hayes","year":"1983","unstructured":"Hayes, A.C., Larman, D.G.: The vertices of the knapsack polytope. Discrete Applied Mathematics\u00a06, 135\u2013138 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02186368","volume":"12","author":"J.N. Hooker","year":"1988","unstructured":"Hooker, J.N.: Generalized resolution and cutting planes. Annals of Operations Research\u00a012, 217\u2013239 (1988)","journal-title":"Annals of Operations Research"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"J.N. Hooker","year":"1992","unstructured":"Hooker, J.N.: Generalized resolution for 0-1 linear inequalities. Annals of Mathematics and Artificial Intelligence\u00a06, 271\u2013286 (1992)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"R.G. Jeroslow","year":"1977","unstructured":"Jeroslow, R.G.: Cutting-plane theory: disjunctive methods. Annals of Discrete Mathematics\u00a01, 293\u2013330 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR30","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Math. Doklady\u00a020, 191\u2013194 (1979)","journal-title":"Soviet Math. Doklady"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM J. Computing\u00a014(1), 196\u2013209 (1985)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"1_CR32","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"1_CR33","first-page":"307","volume-title":"The Traveling Salesman Problem","author":"M.W. Padberg","year":"1985","unstructured":"Padberg, M.W., Gr\u00f6tschel, M.: Polyhedral Computations. In: Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A., Shmoys, D.B. (eds.) The Traveling Salesman Problem, pp. 307\u2013360. John Wiley & Sons, Chichester (1985)"},{"issue":"3","key":"1_CR34","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P. Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic\u00a062(3), 981\u2013988 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: On the complexity of the propositional calculus. In: Sets and Proofs, Invited papers from Logic Colloquium 1997, pp. 197\u2013218. Cambridge Univ. Press, Cambridge (1999)","DOI":"10.1017\/CBO9781107325944.010"},{"issue":"2","key":"1_CR36","first-page":"354","volume":"31","author":"A.A. Razborov","year":"1985","unstructured":"Razborov, A.A.: Lower bounds on the monotone complexity of some Boolean functions. Soviet Math. Dokl.\u00a031(2), 354\u2013357 (1985)","journal-title":"Soviet Math. Dokl."},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A.: On cutting planes. Annals of Discrete Mathematics\u00a09, 291\u2013296 (1980)","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR38","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"1_CR39","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with disjunctive constraints","author":"H.D. Sherali","year":"1980","unstructured":"Sherali, H.D., Shetty, C.M.: Optimization with disjunctive constraints. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0181. Springer, Heidelberg (1980)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720084_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T17:26:26Z","timestamp":1707499586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720084_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672814","9783540464211"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/10720084_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}