{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:18:19Z","timestamp":1765545499215},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_22","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T05:41:20Z","timestamp":1211175680000},"page":"278-282","source":"Crossref","is-referenced-by-count":9,"title":["Counting Solutions of Integer Programs Using Unrestricted Subtree Detection"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim.\u00a04, 4\u201320 (2007)","journal-title":"Discrete Optim."},{"key":"22_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming, PhD thesis, TU Berlin (2007)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A.I. Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res.\u00a019, 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with BDDs. In: Workshop on Algorithm Engineering and Experiments (ALENEX) (2007)","DOI":"10.1137\/1.9781611972870.15"},{"key":"22_CR5","first-page":"16","volume":"25","author":"R.E. Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News\u00a025, 16 (1992)","journal-title":"SIAM News"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"Systems Modelling and Optimization: Methods, Theory, and Applications","author":"R.E. Bixby","year":"2000","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice \u2013 closing the gap. In: Powell, M., Scholtes, S. (eds.) Systems Modelling and Optimization: Methods, Theory, and Applications, pp. 19\u201349. Kluwer, Dordrecht (2000)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0925-7721(98)00021-2","volume":"11","author":"M.R. Bussieck","year":"1998","unstructured":"Bussieck, M.R., L\u00fcbbecke, M.E.: The vertex set of a 0\/1-polytope is strongly P-enumerable. Comput. Geom.\u00a011, 103\u2013109 (1998)","journal-title":"Comput. Geom."},{"key":"22_CR8","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":"22_CR9","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J.A. Loera De","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput.\u00a038, 1273\u20131302 (2004)","journal-title":"J. Symb. Comput."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11814948_37","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"A. Morgado","year":"2006","unstructured":"Morgado, A., Matos, P.J., Manquinho, V.M., Silva, J.P.M.: Counting models in integer domains. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 410\u2013423. Springer, Heidelberg (2006)"},{"key":"22_CR11","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, New York (1988)"},{"key":"22_CR12","unstructured":"Sandholm, T., Shields, R.: Nogood learning for mixed integer programming, Tech. Report CMU-CS-06-155, Carnegie Mellon University, Computer Science Department (2006)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M. Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 Counting Models with Advanced Component Caching and Implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 424\u2013429. Springer, Heidelberg (2006)"},{"key":"22_CR14","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus, PhD thesis, TU Berlin (1996)"}],"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-540-68155-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:27Z","timestamp":1620002307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_22","relation":{},"subject":[]}}