{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:09:10Z","timestamp":1726513750666},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,3,3]],"date-time":"2016-03-03T00:00:00Z","timestamp":1456963200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10601-016-9239-9","type":"journal-article","created":{"date-parts":[[2016,3,3]],"date-time":"2016-03-03T06:53:36Z","timestamp":1456988016000},"page":"533-556","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Theoretical insights and algorithmic tools for decision diagram-based optimization"],"prefix":"10.1007","volume":"21","author":[{"given":"David","family":"Bergman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre A.","family":"Cire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,3]]},"reference":[{"key":"9239_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., & Tiedemann, P. (2007). 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.","DOI":"10.1007\/978-3-540-74970-7_11"},{"key":"9239_CR2","doi-asserted-by":"crossref","unstructured":"Becker, B., Behle, M., Eisenbrand, F., & Wimmer, R. (2005). BDDS in a branch and cut framework. In Nikoletseas, S. (Ed.) Experimental and efficient algorithms, proceedings of the 4th international workshop on efficient and experimental algorithms (WEA 05). Lecture notes in computer science, (Vol. 3503 pp. 452\u2013463): Springer.","DOI":"10.1007\/11427186_39"},{"key":"9239_CR3","doi-asserted-by":"crossref","unstructured":"Behle, M. (2007). On threshold BDDs and the optimal variable ordering problem. In COCOA\u201907: Proceedings Of the 1st international conference on combinatorial optimization and applications (pp. 124\u2013135). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-73556-4_15"},{"key":"9239_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. (2014). MDD Propagation for sequence constraints. Journal of Artificial Intelligence Research, 50, 697\u2013722.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"9239_CR5","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. (2014). Optimization bounds from binary decision diagrams. INFORMS Journal on Computing, 26(2), 253\u2013268.","journal-title":"INFORMS Journal on Computing"},{"key":"9239_CR6","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., & Hooker, J.N. (2015). Discrete optimization with decision diagrams. INFORMS Journal on Computing. to appear."},{"issue":"2","key":"9239_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10732-014-9238-1","volume":"20","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J.J., & Yunes, T.H. (2014). BDD-Based heuristics for binary optimization. Journal of Heuristics, 20(2), 211\u2013234.","journal-title":"Journal of Heuristics"},{"key":"9239_CR8","doi-asserted-by":"publisher","unstructured":"Bergman, D., Cir\u00e9, A.A., Sabharwal, A., Samulowitz, H., Saraswat, V.A., & van Hoeve, W.J. (2014). Parallel combinatorial optimization with decision diagrams. In Simonis, H. (Ed.) Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings. Lecture Notes in Computer Science. doi: 10.1007\/978-3-319-07046-9_25 , (Vol. 8451 pp. 351\u2013367) Springer.","DOI":"10.1007\/978-3-319-07046-9_25"},{"issue":"3","key":"9239_CR9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/s10601-015-9193-y","volume":"20","author":"D Bergman","year":"2015","unstructured":"Bergman, D., Cire, A.A., & van Hoeve, W.J. (2015). Lagrangian bounds from decision diagrams. Constraints, 20(3), 346\u2013361.","journal-title":"Constraints"},{"key":"9239_CR10","doi-asserted-by":"crossref","unstructured":"Bergman, D., van Hoeve, W.J., & Hooker, J.N. (2011). Manipulating MDD relaxations for combinatorial optimization. In Achterberg, T., & Beck, J.C. (Eds.) CPAIOR. Lecture notes in computer science, (Vol. 6697 pp. 20\u201335): Springer.","DOI":"10.1007\/978-3-642-21311-3_5"},{"key":"9239_CR11","unstructured":"Bergman, D. (2013). New techniques for discrete optimization. Ph.D. thesis, Carnegie Mellon University."},{"key":"9239_CR12","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E. (1986). Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35, 677\u2013691.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"9239_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"KC Cheng","year":"2010","unstructured":"Cheng, K.C., & Yap, R.H. (2010). An mdd-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints, 15(2), 265\u2013304.","journal-title":"Constraints"},{"key":"9239_CR14","unstructured":"Cire, A.A., & van Hoeve, W.J. (2012). MDD Propagation for disjunctive scheduling. In Proceedings of the twenty-second international conference on automated planing and scheduling (ICAPS) (pp. 1\u20131): AAAI Press."},{"issue":"6","key":"9239_CR15","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., & van Hoeve, W.J. (2013). Multivalued decision diagrams for sequencing problems. Operations Research, 61(6), 1411\u20131428.","journal-title":"Operations Research"},{"issue":"2","key":"9239_CR16","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D. (1998). Finding the k shortest paths. SIAM J. Comput., 28(2), 652\u2013673.","journal-title":"SIAM J. Comput."},{"key":"9239_CR17","doi-asserted-by":"crossref","unstructured":"Gopalan, P., Klivans, A., Meka, R., Stefankovic, D., Vempala, S., & Vigoda, E. (2011). An fptas for #knapsack and related counting problems. In IEEE 52nd annual symposium on Foundations of computer science (FOCS), 2011 (pp. 817\u2013826).","DOI":"10.1109\/FOCS.2011.32"},{"key":"9239_CR18","unstructured":"Hadzic, T., & Hooker, J.N. (2007). Cost-bounded binary decision diagrams for 0-1 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."},{"key":"9239_CR19","unstructured":"Hadzic, T., Hooker, J.N., O\u2019Sullivan, B., & Tiedemann, P. (2008). 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."},{"key":"9239_CR20","doi-asserted-by":"crossref","unstructured":"Hadzic, T., Hooker, J.N., & Tiedemann, P. (2008). Propagating separable equalities in an MDD store. In Perron, L., & Trick, M.A. (Eds.) Proceedings of the international workshop on integration of artificial intelligence and operations research techniques in constraint programming for combintaorial optimization problems (CPAIOR 2008). Lecture notes in computer science, (Vol. 5015 pp. 318\u2013322): Springer.","DOI":"10.1007\/978-3-540-68155-7_30"},{"key":"9239_CR21","unstructured":"Hoda, S., Hoeve, W.J.V., & Hooker, J.N. (2010). 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."},{"key":"9239_CR22","doi-asserted-by":"crossref","unstructured":"Hooker, J.N. (2013). Decision diagrams and dynamic programming. In Gomes, C.P., & Sellmann, M. (Eds.) CPAIOR. Lecture notes in computer science, (Vol. 7874 pp. 94\u2013110): Springer.","DOI":"10.1007\/978-3-642-38171-3_7"},{"issue":"1-2","key":"9239_CR23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(97)83807-8","volume":"180","author":"K Hosaka","year":"1997","unstructured":"Hosaka, K., Takenaga, Y., Kaneda, T., & Yajima, S. (1997). Size of ordered binary decision diagrams representing threshold functions. Theoretical Computer Science, 180(1-2), 47\u201360.","journal-title":"Theoretical Computer Science"},{"key":"9239_CR24","unstructured":"Lokshtanov, D. (2009). New methods in parameterized algorithms and complexity. Ph.D. thesis, University of Bergen."},{"key":"9239_CR25","unstructured":"Rothvo\u00df, T. (2011). Some 0\/1 polytopes need exponential size extended formulations. arXiv: 1105.0036 ."},{"key":"9239_CR26","unstructured":"Rothvo\u00df, T. (2014). The matching polytope has exponential extension complexity. In Proceedings of the 46th annual ACM symposium on theory of computing (pp. 263\u2013272). New York, NY, USA: STOC \u201914, ACM."},{"key":"9239_CR27","doi-asserted-by":"crossref","unstructured":"Wegener, I. (2000). Branching programs and binary decision diagrams: theory and applications. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898719789"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9239-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9239-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9239-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9239-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T05:57:27Z","timestamp":1567663047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9239-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,3]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9239"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9239-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,3]]}}}