{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T23:10:28Z","timestamp":1740265828783,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_38","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:56:25Z","timestamp":1279144585000},"page":"451-458","source":"Crossref","is-referenced-by-count":3,"title":["On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization"],"prefix":"10.1007","author":[{"given":"Vasco","family":"Manquinho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J.: On applying cutting planes in dll-based algorithms for pseudo-boolean optimization. Technical Report RT\/003\/05-CDIL, INESC-ID (2005)","key":"38_CR1","DOI":"10.1007\/11499107_38"},{"doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J.P.: Effective lower bounding techniques for pseudo-boolean optimization. In: Design, Automation and Test in Europe Conference (2005)","key":"38_CR2","DOI":"10.1109\/DATE.2005.126"},{"doi-asserted-by":"crossref","unstructured":"Coudert, O.: On Solving Covering Problems. In: Design Automation Conference, pp. 197\u2013202 (1996)","key":"38_CR3","DOI":"10.1145\/240518.240555"},{"doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A Fast Pseudo-Boolean Constraint Solver. In: Design Automation Conference, pp. 830\u2013835 (2003)","key":"38_CR4","DOI":"10.1145\/775832.776041"},{"key":"38_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R. Gomory","year":"1958","unstructured":"Gomory, R.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"38_CR7","first-page":"65","volume-title":"Handbook of Applied Optimization","author":"J. Mitchell","year":"2002","unstructured":"Mitchell, J.: Branch-and-cut algorithms for combinatorial optimization problems. In: Handbook of Applied Optimization, pp. 65\u201377. Oxford University Press, Oxford (2002)"},{"doi-asserted-by":"crossref","unstructured":"Aloul, F., Ramani, A., Markov, I., Sakallah, K.: Generic ILP versus specialized 0-1 ILP: An update. In: International Conference on Computer Aided Design, pp. 450\u2013457 (2002)","key":"38_CR8","DOI":"10.1145\/774572.774638"},{"unstructured":"Barth, P.: A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science (1995)","key":"38_CR9"},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","volume":"6","author":"R.E. Bixby","year":"1994","unstructured":"Bixby, R.E.: Progress in linear programming. ORSA Journal on computing\u00a06, 15\u201322 (1994)","journal-title":"ORSA Journal on computing"},{"doi-asserted-by":"crossref","unstructured":"Liao, S., Devadas, S.: Solving Covering Problems Using LPR-Based Lower Bounds. In: Design Automation Conference, pp. 117\u2013120 (1997)","key":"38_CR11","DOI":"10.1109\/DAC.1997.597128"},{"key":"38_CR12","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":"38_CR13","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":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-59408-6_71","volume-title":"Integer Programming and Combinatorial Optimization","author":"S. Ceria","year":"1995","unstructured":"Ceria, S., Cornu\u00e9jols, G., Dawande, M.: Combining and strengthening Gomory cuts. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 438\u2013451. Springer, Heidelberg (1995)"},{"key":"38_CR15","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R. Gomory","year":"1963","unstructured":"Gomory, R.: An algorithm for integer solutions to linear programs. In: Graves, R., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A new search algorithm for satisfiability. In: International Conference on Computer-Aided Design, pp. 220\u2013227 (1996)","key":"38_CR16","DOI":"10.1109\/ICCAD.1996.569607"},{"unstructured":"Zhu, Z.: Synthesis for mixed ptl\/cmos circuit, http:\/\/www-unix.ecs.umass.edu\/~zzhu\/","key":"38_CR17"},{"unstructured":"Yang, S.: Logic Synthesis and Optimization Benchmarks User Guide. Microelectronics Center of North Carolina (1991)","key":"38_CR18"},{"doi-asserted-by":"crossref","unstructured":"Pizzuti, C.: Computing Prime Implicants by Integer Programming. In: IEEE International Conference on Tools with Artificial Intelligence, pp. 332\u2013336 (1996)","key":"38_CR19","DOI":"10.1109\/TAI.1996.560473"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:30:47Z","timestamp":1740263447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11499107_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}