{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:24Z","timestamp":1725680364042},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_3","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T03:59:40Z","timestamp":1336967980000},"page":"34-49","source":"Crossref","is-referenced-by-count":26,"title":["Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem"],"prefix":"10.1007","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[]},{"given":"Andre A.","family":"Cire","sequence":"additional","affiliation":[]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[]},{"given":"John N.","family":"Hooker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Transactions on Computers\u00a0C-27, 509\u2013516 (1978)","journal-title":"IEEE Transactions on Computers"},{"key":"3_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":"H.R. 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.\u00a04741, pp. 118\u2013132. Springer, Heidelberg (2007)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11427186_39","volume-title":"Experimental and Efficient Algorithms","author":"B. Becker","year":"2005","unstructured":"Becker, B., Behle, M., Eisenbrand, F., Wimmer, R.: BDDs in a Branch and Cut Framework. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 452\u2013463. Springer, Heidelberg (2005)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with bdds. In: ALENEX. SIAM (2007)","DOI":"10.1137\/1.9781611972870.15"},{"key":"3_CR5","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., van Hoeve, W.-J., Hooker, J.N.: Manipulating MDD Relaxations for Combinatorial Optimization. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol.\u00a06697, pp. 20\u201335. Springer, Heidelberg (2011)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bollig, Wegener: Improving the variable ordering of OBDDs is NP-complete. IEEETC: IEEE Transactions on Computers\u00a045 (1996)","DOI":"10.1109\/12.537122"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/S089548019528993X","volume":"11","author":"N.J. Calkin","year":"1998","unstructured":"Calkin, N.J., Wilf, H.S.: The number of independent sets in a grid graph. SIAM J. Discrete Math.\u00a011(1), 54\u201360 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/S0097539701383844","volume":"31","author":"M.E. Dyer","year":"2002","unstructured":"Dyer, M.E., Frieze, A.M., Jerrum, M.: On counting independent sets in sparse graphs. SIAM J. Comput.\u00a031(5), 1527\u20131541 (2002)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/TCAD.2003.819427","volume":"22","author":"R. Ebendt","year":"2003","unstructured":"Ebendt, R., Gunther, W., Drechsler, R.: An improved branch and bound algorithm for exact BDD minimization. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a022(12), 1657\u20131663 (2003)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"issue":"1-3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0012-365X(97)00185-4","volume":"186","author":"F. Forbes","year":"1998","unstructured":"Forbes, F., Ycart, B.: Counting stable sets on cartesian products of graphs. Discrete Mathematics\u00a0186(1-3), 105\u2013116 (1998)","journal-title":"Discrete Mathematics"},{"key":"3_CR12","unstructured":"Hadzic, T., Hooker, J.N.: Postoptimality analysis for integer programming using binary decision diagrams. Presented at GICOLAG Workshop (Global Optimization: Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry), Vienna. Technical report, Carnegie Mellon University (2006)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Hadzic, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0-1 programming. Technical report, Carnegie Mellon University (2007)","DOI":"10.1007\/978-3-540-72397-4_7"},{"key":"3_CR14","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.\u00a05202, pp. 448\u2013462. Springer, Heidelberg (2008)"},{"key":"3_CR15","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., van Hoeve, W.-J., Hooker, J.N.: A Systematic Approach to MDD-Based Constraint Programming. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 266\u2013280. Springer, Heidelberg (2010)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C. Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages de lignes. J. Reine Angew Math.\u00a070, 185\u2013190 (1869)","journal-title":"J. Reine Angew Math."},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C.Y. Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Systems Technical Journal\u00a038, 985\u2013999 (1959)","journal-title":"Bell Systems Technical Journal"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y. Zhao","year":"2010","unstructured":"Zhao, Y.: The number of independent sets in a regular graph. Combinatorics, Probability & Computing\u00a019(2), 315\u2013320 (2010)","journal-title":"Combinatorics, Probability & Computing"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:46:31Z","timestamp":1556775991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}