{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:11:00Z","timestamp":1780632660543,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,11]],"date-time":"2014-02-11T00:00:00Z","timestamp":1392076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10732-014-9238-1","type":"journal-article","created":{"date-parts":[[2014,2,10]],"date-time":"2014-02-10T15:50:09Z","timestamp":1392047409000},"page":"211-234","source":"Crossref","is-referenced-by-count":26,"title":["BDD-based heuristics for binary optimization"],"prefix":"10.1007","volume":"20","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andre A.","family":"Cire","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tallys","family":"Yunes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,2,11]]},"reference":[{"key":"9238_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"key":"9238_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C\u201327","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C\u201327, 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"9238_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessi\u00e8re, C. (ed.) Principles and Practice of Constraint Programming (CP 2007). Lecture Notes in Computer Science, vol. 4741, pp 118\u2013132. Springer, New York (2007)","DOI":"10.1007\/978-3-540-74970-7_11"},{"key":"9238_CR4","doi-asserted-by":"crossref","unstructured":"Becker, B., Behle, M., Eisenbrand, F., Wimmer, R.: BDDs in a branch and cut framework. In: Nikoletseas, S. (ed.) Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA 05). Lecture Notes in Computer Science, vol. 3503, pp 452\u2013463. Springer, New York (2005)","DOI":"10.1007\/11427186_39"},{"key":"9238_CR5","doi-asserted-by":"crossref","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with BDDs. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp 158\u2013165. SIAM, Philadelphia (2007)","DOI":"10.1137\/1.9781611972870.15"},{"key":"9238_CR6","doi-asserted-by":"crossref","unstructured":"Bergman, D., van Hoeve, W.J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Achterberg, T., Beck, J. (eds.) CPAIOR. Lecture Notes in Computer Science, vol. 6697, pp 20\u201335. Springer, New York (2011)","DOI":"10.1007\/978-3-642-21311-3_5"},{"key":"9238_CR7","doi-asserted-by":"crossref","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, E. (eds.) 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR\u201912). Lectures Notes in Computer Science, vol. 7298, pp 34\u201349. Springer, Nantes (2012)","DOI":"10.1007\/978-3-642-29828-8_3"},{"key":"9238_CR8","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Master\u2019s thesis, Zuze Institute, Berlin (2006)"},{"issue":"2","key":"9238_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/ijoc.1110.0496","volume":"25","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Iancu, D.A., Katz, D.: A new local search algorithm for binary optimization. INFORMS J. Comput. 25(2), 208\u2013221 (2013)","journal-title":"INFORMS J. Comput."},{"key":"9238_CR10","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"9238_CR11","first-page":"2000","volume":"98","author":"A Caprara","year":"1998","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 2000 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9238_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s006070050002","volume":"62","author":"GMD Corso","year":"1999","unstructured":"Corso, G.M.D., Manzini, G.: Finding exact solutions to the bandwidth minimization problem. Computing 62(3), 189\u2013203 (1999)","journal-title":"Computing"},{"issue":"5","key":"9238_CR13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-007-9021-7","volume":"13","author":"J Eckstein","year":"2007","unstructured":"Eckstein, J., Nediak, M.: Pivot, cut, and dive: a heuristic for 0\u20131 mixed integer programming. J. Heuristics 13(5), 471\u2013503 (2007)","journal-title":"J. Heuristics"},{"issue":"3","key":"9238_CR14","doi-asserted-by":"crossref","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. 60(3), 510\u2013539 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9238_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program 104(1), 91\u2013104 (2005)","journal-title":"Math. Program"},{"key":"9238_CR16","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"issue":"4","key":"9238_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00132504","volume":"2","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General purpose heuristics for integer programming\u2014part I. J. Heuristics 2(4), 343\u2013358 (1997a)","journal-title":"J. Heuristics"},{"issue":"2","key":"9238_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009631530787","volume":"3","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General purpose heuristics for integer programming\u2014part II. J. Heuristics 3(2), 161\u2013179 (1997b)","journal-title":"J. Heuristics"},{"issue":"6","key":"9238_CR19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"key":"9238_CR20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"EM Gurari","year":"1984","unstructured":"Gurari, E.M., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. J. Algorithms 5, 531\u2013546 (1984)","journal-title":"J. Algorithms"},{"key":"9238_CR21","unstructured":"Hadzic, T., Hooker, J.N.: Postoptimality analysis for integer programming using binary decision diagrams. In: Presented at GICOLAG Workshop (Global Optimization: Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry). Technical Report. Carnegie Mellon University, Vienna (2006)"},{"key":"9238_CR22","doi-asserted-by":"crossref","unstructured":"Hadzic, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0\u20131 programming. In: Loute, E., Wolsey, L. (eds.) Proceedings of the International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007). Lecture Notes in Computer Science, vol. 4510, pp 84\u201398. Springer, New York (2007)","DOI":"10.1007\/978-3-540-72397-4_7"},{"key":"9238_CR23","doi-asserted-by":"crossref","unstructured":"Hadzic, T., Hooker, J.N., O\u2019Sullivan, B., Tiedemann, P.: Approximate compilation of constraints into multivalued decision diagrams. In: Stuckey, P.J. (ed.) Principles and Practice of Constraint Programming (CP 2008). Lecture Notes in Computer Science, vol. 5202, pp 448\u2013462. Springer, New York (2008)","DOI":"10.1007\/978-3-540-85958-1_30"},{"key":"9238_CR24","doi-asserted-by":"crossref","unstructured":"Hoda, S., Hoeve, W.J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: Proceedings of the 16th International Conference on Principles and Practices of Constraint Programming. Lecture Notes in Computer Science, vol. 6308, pp 266\u2013280. Springer, New York (2010)","DOI":"10.1007\/978-3-642-15396-9_23"},{"key":"9238_CR25","unstructured":"Hu, A.J.: Techniques for efficient formal verification using binary decision diagrams. Thesis CS-TR-95-1561, Department of Computer Science, Stanford University (1995)"},{"key":"9238_CR26","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."},{"issue":"2","key":"9238_CR27","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 135(2), 450\u2013459 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9238_CR28","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 186(2), 513\u2013528 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9238_CR29","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 153(1), 200\u2013210 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9238_CR30","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10732-010-9131-5","volume":"17","author":"W Pullan","year":"2011","unstructured":"Pullan, W., Mascia, F., Brunato, M.: Cooperating local search for the maximum clique problem. J. Heuristics 17(2), 181\u2013199 (2011)","journal-title":"J. Heuristics"},{"key":"9238_CR31","doi-asserted-by":"crossref","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 Methods 1, 363\u2013369 (1980)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"9238_CR32","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams: theory and applications. In: SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9238-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9238-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9238-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:04:46Z","timestamp":1565172286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9238-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,11]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9238"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9238-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,11]]}}}