{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:36:19Z","timestamp":1725492979851},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"},{"type":"electronic","value":"9783540749707"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74970-7_36","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"498-513","source":"Crossref","is-referenced-by-count":2,"title":["AND\/OR Multi-valued Decision Diagrams for Constraint Optimization"],"prefix":"10.1007","author":[{"given":"Robert","family":"Mateescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Marinescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Dechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transaction on Computers"},{"issue":"4","key":"36_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/B:CONS.0000049204.75635.7e","volume":"9","author":"H. Fargier","year":"2004","unstructured":"Fargier, H., Vilarem, M.: Compiling CSPs into tree-driven automata for interactive solving. Constraints\u00a09(4), 263\u2013287 (2004)","journal-title":"Constraints"},{"key":"36_CR3","unstructured":"Hadzic, T., Andersen, H.R.: A BDD-based polytime algorithm for cost-bounded interactive configuration. In: National Conference on Artificial Intelligence (AAAI 2006) (2006)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Hadzic, T., Hooker, J.: Cost-bounded binary decision diagrams for 0-1 programming. In: International Conference on Integration of AI and OR Techniques (CPAIOR 2007) (2007)","DOI":"10.1007\/978-3-540-72397-4_7"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2006.11.003","volume":"171","author":"R. Dechter","year":"2007","unstructured":"Dechter, R., Mateescu, R.: AND\/OR search spaces for graphical models. Artificial Intelligence\u00a0171, 73\u2013106 (2007)","journal-title":"Artificial Intelligence"},{"key":"36_CR6","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound for graphical models. In: International Joint Conferences on Artificial Intelligence (IJCAI 2005), pp. 224\u2013229 (2005)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11889205_25","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"R. Mateescu","year":"2006","unstructured":"Mateescu, R., Dechter, R.: Compiling constraint networks into AND\/OR multi-valued decision diagrams (AOMDDs). In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 329\u2013343. Springer, Heidelberg (2006)"},{"key":"36_CR8","unstructured":"Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: International Joint Conferences on Artificial Intelligence (IJCAI 1985), pp. 1076\u20131078 (1985)"},{"key":"36_CR9","unstructured":"Bayardo, R., Miranker, D.: A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In: National Conference on Artificial Intelligence (AAAI 1996), pp. 298\u2013304 (1996)"},{"key":"36_CR10","unstructured":"Marinescu, R., Dechter, R.: Memory intensive branch-and-bound search for graphical models. In: National Conference on Artificial Intelligence (AAAI 2006) (2006)"},{"key":"36_CR11","unstructured":"Marinescu, R., Dechter, R.: Best-first AND\/OR search for graphical models. In: National Conference on Artificial Intelligence (AAAI 2007) (2007)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/256303.256306","volume":"44","author":"S. Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Semiring based constraint solving and optimization. Journal of ACM\u00a044, 309\u2013315 (1997)","journal-title":"Journal of ACM"},{"key":"36_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization.","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, Chichester (1988)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"Bensana, E., Lemaitre, M., Verfaillie, G.: Earth observation satellite management. Constraints\u00a04, 293\u2013299 (1999)","journal-title":"Constraints"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound search for pure 0\/1 integer linear programming problems. In: International Conference on Integration of AI and OR Techniques (CPAIOR 2006), pp. 152\u2013166 (2006)","DOI":"10.1007\/11757375_14"},{"key":"36_CR16","unstructured":"Dantzig, G.: Maximization of a linear function of variables subject to linear inequalities. Activity Analysis of Production and Allocation\u00a0 (1951)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. ACM Electronic Commerce, 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for max-SAT and weighted max-SAT. Satisfiability Problem: Theory and Applications, 519\u2013536 (1997)","DOI":"10.1090\/dimacs\/035\/13"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S. Givry de","year":"2003","unstructured":"de Givry, S., Larrosa, J., Schiex, T.: Solving max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T12:12:10Z","timestamp":1708258330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749691","9783540749707"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}