{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:39:06Z","timestamp":1759667946408,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_4","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"41-50","source":"Crossref","is-referenced-by-count":4,"title":["On Finding the Optimal BDD Relaxation"],"prefix":"10.1007","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[]},{"given":"Andre Augusto","family":"Cire","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 27, 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74970-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"HR Andersen","year":"2007","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118\u2013132. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_11 . http:\/\/dx.doi.org\/10.1007\/978-3-540-74970-7_11"},{"issue":"2","key":"4_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10878-007-9123-z","volume":"16","author":"M Behle","year":"2007","unstructured":"Behle, M.: On threshold BDDs and the optimal variable ordering problem. J. Comb. Optim. 16(2), 107\u2013118 (2007). http:\/\/dx.doi.org\/10.1007\/s10878-007-9123-z","journal-title":"J. Comb. Optim."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1613\/jair.4199","volume":"50","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J.: MDD propagation for sequence constraints. J. Artif. Intell. Res. 50, 697\u2013722 (2014). http:\/\/dx.doi.org\/10.1613\/jair.4199","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-29828-8_3","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D Bergman","year":"2012","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J., Hooker, J.N.: Variable ordering for the application of BDDs to the maximum independent set problem. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 34\u201349. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29828-8_3"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/ijoc.2013.0561","volume":"26","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Optimization bounds from binary decision diagrams. INFORMS J. Comput. 26(2), 253\u2013268 (2014). http:\/\/dx.doi.org\/10.1287\/ijoc.2013.0561","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"4_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016)","journal-title":"INFORMS J. Comput."},{"key":"4_CR8","series-title":"Artificial Intelligence: Foundations, Theory, and Algorithms","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, 1st edn. Springer, Switzerland (2016)","edition":"1"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-21311-3_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D Bergman","year":"2011","unstructured":"Bergman, D., Hoeve, W.-J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 20\u201335. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21311-3_5 . http:\/\/dx.doi.org\/10.1007\/978-3-642-21311-3_5"},{"key":"4_CR10","volume-title":"Dynamic Programming and Optimal Control","author":"DP Bertsekas","year":"2012","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 4th edn. Athena Scientific, Belmont (2012)","edition":"4"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv. 24, 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"4_CR13","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/43.833206","volume":"19","author":"R Drechsler","year":"2000","unstructured":"Drechsler, R., Drechsler, N., G\u00fcnther, W.: Fast exact minimization of BDD\u2019s. IEEE Trans. CAD Integr. Circ. Syst. 19(3), 384\u2013389 (2000). http:\/\/dx.doi.org\/10.1109\/43.833206","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Felt, E., York, G., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Dynamic variable reordering for BDD minimization. In: Proceedings of the European Design Automation Conference 1993, EURO-DAC 1993 with EURO-VHDL 1993, Hamburg, Germany, 20\u201324 September 1993. pp. 130\u2013135. IEEE Computer Society (1993). http:\/\/dx.doi.org\/10.1109\/EURDAC.1993.410627","DOI":"10.1109\/EURDAC.1993.410627"},{"key":"4_CR15","unstructured":"Gogate, V., Domingos, P.M.: Approximation by quantization. CoRR abs\/1202.3723 (2012). http:\/\/arxiv.org\/abs\/1202.3723"},{"key":"4_CR16","unstructured":"Gogate, V., Domingos, P.M.: Structured message passing. In: Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, UAI 2013, Bellevue, WA, USA, 11\u201315 August 2013 (2013). https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=2386&proceeding_id=29"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, W., Drechsler, R.: Linear transformations and exact minimization of BDDs. In: 8th Great Lakes Symposium on VLSI (GLS-VLSI 1998), 19\u201321 February 1998, Lafayette, LA, USA, pp. 325\u2013330. IEEE Computer Society (1998). http:\/\/dx.doi.org\/10.1109\/GLSV.1998.665287","DOI":"10.1109\/GLSV.1998.665287"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-85958-1_30","volume-title":"Principles and Practice of Constraint Programming","author":"T Hadzic","year":"2008","unstructured":"Hadzic, T., Hooker, J.N., O\u2019Sullivan, B., Tiedemann, P.: Approximate compilation of constraints into multivalued decision diagrams. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 448\u2013462. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85958-1_30"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-15396-9_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"S Hoda","year":"2010","unstructured":"Hoda, S., Hoeve, W.-J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 266\u2013280. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15396-9_23 . http:\/\/dl.acm.org\/citation.cfm?id=1886008.1886034"},{"issue":"3","key":"4_CR20","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G., Say\u0131n, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221713006474","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38, 985\u2013999 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"4_CR22","unstructured":"Shiple, T.R., Hojati, R., Sangiovanni-Vincentelli, A.L., Brayton, R.K.: Heuristic minimization of BDDs using don\u2019t cares. In: DAC, pp. 225\u2013231 (1994). http:\/\/doi.acm.org\/10.1145\/196244.196360"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Soeken, M., Gro\u00dfe, D., Chandrasekharan, A., Drechsler, R.: BDD minimization for approximate computing. In: 21st Asia and South Pacific Design Automation Conference, ASP-DAC 2016, Macao, Macao, 25\u201328 January 2016, pp. 474\u2013479. IEEE (2016). http:\/\/dx.doi.org\/10.1109\/ASPDAC.2016.7428057","DOI":"10.1109\/ASPDAC.2016.7428057"},{"key":"4_CR24","unstructured":"St-Aubin, R., Hoey, J., Boutilier, C.: APRICODD: approximate policy construction using decision diagrams. In: Proceedings of Conference on Neural Information Processing Systems, pp. 1089\u20131095 (2000)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:39:23Z","timestamp":1569382763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}