{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:23:24Z","timestamp":1780633404997,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642213106","type":"print"},{"value":"9783642213113","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_5","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"20-35","source":"Crossref","is-referenced-by-count":52,"title":["Manipulating MDD Relaxations for Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John N.","family":"Hooker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_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":"5_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":"5_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":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-73556-4_15","volume-title":"Combinatorial Optimization and Applications","author":"M. Behle","year":"2007","unstructured":"Behle, M.: On Threshold BDDs and the Optimal Variable Ordering Problem. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol.\u00a04616, pp. 124\u2013135. Springer, Heidelberg (2007)"},{"key":"5_CR5","volume-title":"Proceedings of ALENEX","author":"M. Behle","year":"2007","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with BDDs. In: Proceedings of ALENEX. SIAM, Philadelphia (2007)"},{"key":"5_CR6","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"},{"key":"5_CR7","unstructured":"Campos, V., Pi\u00f1ana, E., Mart\u00ed, R.: Adaptive memory programming for matrix bandwidth minimization. Annals of Operations Research (to appear)"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s006070050002","volume":"62","author":"G.M. Del Corso","year":"1999","unstructured":"Del Corso, G.M., Manzini, G.: Finding exact solutions to the bandwidth minimization problem. Computing\u00a062(3), 189\u2013203 (1999)","journal-title":"Computing"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci.\u00a060(3), 510\u2013539 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac.\u00a0J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pac.\u00a0J. Math."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gurari, E.M., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. ALGORITHMS: Journal of Algorithms\u00a05 (1984)","DOI":"10.1016\/0196-6774(84)90006-3"},{"key":"5_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":"5_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":"5_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":"5_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":"5_CR16","volume-title":"Integrated Methods for Optimization","author":"J.N. Hooker","year":"2007","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer, Heidelberg (2007)"},{"key":"5_CR17","unstructured":"Hu, A.J.: Techniques for Efficient Formal Verification Using Binary Decision Diagrams. Technical Report CS-TR-95-1561, Stanford University, Department of Computer Science (1995)"},{"key":"5_CR18","first-page":"9","volume":"4","author":"T. Kam","year":"1998","unstructured":"Kam, T., Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Multi-valued decision diagrams: Theory and applications. International Journal on Multiple-Valued Logic\u00a04, 9\u201362 (1998)","journal-title":"International Journal on Multiple-Valued Logic"},{"key":"5_CR19","doi-asserted-by":"publisher","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":"5_CR20","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R. Mart\u00ed","year":"2008","unstructured":"Mart\u00ed, R., Campos, V., Pi\u00f1ana, E.: A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research\u00a0186(2), 513\u2013528 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/S0377-2217(00)00325-8","volume":"135","author":"R. Mart\u00ed","year":"2001","unstructured":"Mart\u00ed, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research\u00a0135(2), 450\u2013459 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E. Pi\u00f1ana","year":"2004","unstructured":"Pi\u00f1ana, E., Plana, I., Campos, V., Mart\u00ed, R.: GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research\u00a0153(1), 200\u2013210 (2004)","journal-title":"European Journal of Operational Research"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J. Saxe","year":"1980","unstructured":"Saxe, J.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discrete Meth.\u00a01, 363\u2013369 (1980)","journal-title":"SIAM J. Algebraic Discrete Meth."}],"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-642-21311-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:05:13Z","timestamp":1609203913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}