{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:40:12Z","timestamp":1725558012773},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_24","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"203-218","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bounds on the Number of Solutions of Binary Integer Programs"],"prefix":"10.1007","author":[{"given":"Siddhartha","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serdar","family":"Kadioglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Achterberg, T.: SCIP - A Framework to Integrate Constraint and Mixed Integer Programming, \n                  \n                    http:\/\/www.zib.de\/Publications\/abstracts\/ZR-04-19\/"},{"key":"24_CR2","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.601","volume":"10","author":"E. Birnbaum","year":"1999","unstructured":"Birnbaum, E., Lozinskii, E.L.: The Good Old Davis-Putnam Procedure Helps Counting Models. Journal of Artificial Intelligence Research\u00a010, 457\u2013477 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-69346-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Cornuejols","year":"1998","unstructured":"Cornuejols, G., Dawande, M.: A class of hard small 0-1 programs. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 284\u2013293. Springer, Heidelberg (1998)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-72792-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"E. Danna","year":"2007","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating Multiple Solutions for Mixed Integer Programming Problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 280\u2013294. Springer, Heidelberg (2007)"},{"key":"24_CR6","unstructured":"Frangioni, A.: Object Bundle Optimization Package, \n                  \n                    www.di.unipi.it\/optimize\/Software\/Bundle.html"},{"key":"24_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1991","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1991)"},{"key":"24_CR8","unstructured":"Gomes, C.P., Hoeve, W., Sabharwal, A., Selman, B.: Counting CSP Solutions Using Generalized XOR Constraints. In: 22nd Conference on Artificial Intelligence (AAAI), pp. 204\u2013209 (2007)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Hadzic, T., O\u2019Mahony, E., O\u2019Sullivan, B., Sellmann, M.: Enhanced Inference for the Market Split Problem. In: 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 716\u2013723 (2009)","DOI":"10.1109\/ICTAI.2009.83"},{"key":"24_CR10","unstructured":"IBM. IBM CPLEX Reference manual and user manual. V12.1, IBM (2009)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-68155-7_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"L. Kroc","year":"2008","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 278\u2013282. Springer, Heidelberg (2008)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Approximated Consistency for Knapsack Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 679\u2013693. Springer, Heidelberg (2003)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-Based Filtering for Shorter Path Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M. Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical Foundations of CP-based Lagrangian Relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 634\u2013647. Springer, Heidelberg (2004)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Sellmann, M., Fahle, T.: Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research (AOR), 17\u201333 (2003)","DOI":"10.1023\/A:1021845304798"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/11564751_72","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"M. Sellmann","year":"2005","unstructured":"Sellmann, M.: Approximated Consistency for the Automatic Recording Constraint. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 822\u2013826. Springer, Heidelberg (2005)"},{"issue":"8","key":"24_CR17","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1016\/j.cor.2008.08.009","volume":"36","author":"M. Sellmann","year":"2009","unstructured":"Sellmann, M.: Approximated Consistency for the Automatic Recording Constraint. Computers and Operations Research\u00a036(8), 2341\u20132347 (2009)","journal-title":"Computers and Operations Research"},{"key":"24_CR18","unstructured":"Sellmann, M.: ARP: A Benchmark Set for the Automatic Recording Problem maintained, \n                  \n                    http:\/\/www.cs.brown.edu\/people\/sello\/arp-benchmark.html"},{"key":"24_CR19","unstructured":"TIVOtm System, \n                  \n                    http:\/\/www.tivo.com"},{"key":"24_CR20","unstructured":"Trick, M.: A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. In: 3rd Int. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp. 113\u2013124 (2001)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"M. Trick","year":"2003","unstructured":"Trick, M.: 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":"24_CR22","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1978","unstructured":"Williams, H.P.: Model Building in Mathematical Programming. Wiley, Chicester (1978)"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-540-74970-7_52","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"A. Zanarini","year":"2007","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 743\u2013757. Springer, Heidelberg (2007)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints\u00a014(3), 392\u2013413","DOI":"10.1007\/s10601-008-9065-9"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:06Z","timestamp":1619784366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}