{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:28:38Z","timestamp":1765960118286},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12532-020-00191-6","type":"journal-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T19:03:01Z","timestamp":1604343781000},"page":"225-256","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Incorporating bounds from decision diagrams into integer programming"],"prefix":"10.1007","volume":"13","author":[{"given":"Christian","family":"Tjandraatmadja","sequence":"first","affiliation":[]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"issue":"1","key":"191_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007)","journal-title":"Discrete Optim."},{"key":"191_CR2","unstructured":"Achterberg, T.: Constraint integer programming. PhD thesis. Technische Universit\u00e4t Berlin (2009)"},{"key":"191_CR3","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. In: ZIB Report, pp. 16\u201344 (2016)"},{"issue":"6","key":"191_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"100","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 100(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"191_CR5","doi-asserted-by":"crossref","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Principles and Practice of Constraint Programming\u2014CP 2007. Springer, pp. 118\u2013132 (2007)","DOI":"10.1007\/978-3-540-74970-7_11"},{"issue":"3","key":"191_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"191_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.: Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1), 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"191_CR8","doi-asserted-by":"crossref","unstructured":"Becker, B., Behle, M., Eisenbrand, F., Wimmer, R.: BDDs in a branch and cut framework. In: Experimental and Efficient Algorithms. Springer, pp. 452\u2013463 (2005)","DOI":"10.1007\/11427186_39"},{"key":"191_CR9","unstructured":"Behle, M.: Binary decision diagrams and integer programming. PhD thesis. Saarbr\u00fccken, Germany: Max Planck Institute for Computer Science (2007)"},{"key":"191_CR10","unstructured":"Benhamou, F., McAllester, D.A., VanHentenryck, P.: CLP(intervals) revisited. In: Proceedings of ILPS, pp. 124\u2013138 (1994)"},{"key":"191_CR11","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cire, A.A.: Decomposition based on decision diagrams. In: International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, pp. 45\u201354 (2016)","DOI":"10.1007\/978-3-319-33954-2_4"},{"issue":"10","key":"191_CR12","doi-asserted-by":"publisher","first-page":"4700","DOI":"10.1287\/mnsc.2017.2849","volume":"64","author":"D Bergman","year":"2017","unstructured":"Bergman, D., Cire, A.A.: Discrete nonlinear optimization by state-space decompositions. Manag. Sci. 64(10), 4700\u20134720 (2017)","journal-title":"Manag. Sci."},{"key":"191_CR13","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J.: Improved constraint propagation via Lagrangian decomposition. In: International Conference on Principles and Practice of Constraint Programming. Springer, pp. 30\u201338 (2015)","DOI":"10.1007\/978-3-319-23219-5_3"},{"issue":"3","key":"191_CR14","doi-asserted-by":"publisher","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.: Lagrangian bounds from decision diagrams. Constraints 20(3), 346\u2013361 (2015)","journal-title":"Constraints"},{"key":"191_CR15","doi-asserted-by":"crossref","unstructured":"Bergman, D., van Hoeve, W.-J., Hooker, J.N.: Manipulating MDD relaxations for combinatorial optimization. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Springer, pp. 20\u201335 (2011)","DOI":"10.1007\/978-3-642-21311-3_5"},{"issue":"2","key":"191_CR16","doi-asserted-by":"publisher","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., Yunes, T.: BDD-based heuristics for binary optimization. J. Heuristics 20(2), 211\u2013234 (2014)","journal-title":"J. Heuristics"},{"key":"191_CR17","doi-asserted-by":"publisher","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. Springer, Berlin (2016)"},{"issue":"1","key":"191_CR18","doi-asserted-by":"publisher","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."},{"issue":"2","key":"191_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/ijoc.2013.0561","volume":"26","author":"D Bergman","year":"2013","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 (2013)","journal-title":"INFORMS J. Comput."},{"key":"191_CR20","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: International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming. Springer, pp. 34\u201349 (2012)","DOI":"10.1007\/978-3-642-29828-8_3"},{"issue":"8","key":"191_CR21","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"191_CR22","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., van Hoeve, W.-J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"key":"191_CR23","doi-asserted-by":"crossref","unstructured":"Davarnia, D., van Hoeve, W.-J.: Outer approximation for integer nonlinear programs via decision diagrams. Mathematical Programming (2020)","DOI":"10.1007\/s10107-020-01475-4"},{"issue":"3","key":"191_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E Davis","year":"1987","unstructured":"Davis, E.: Constraint propagation with interval labels. Artif. Intell. 32(3), 281\u2013331 (1987)","journal-title":"Artif. Intell."},{"key":"191_CR25","unstructured":"DIMACS maximum clique benchmark set. http:\/\/iridia.ulb.ac.be\/~fmascia\/maximum_clique\/DIMACS-benchmark (2018). Accessed 14 Dec 2018"},{"issue":"2","key":"191_CR26","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher, M.L.: An applications oriented guide to Lagrangian relaxation. Interfaces 15(2), 10\u201321 (1985)","journal-title":"Interfaces"},{"key":"191_CR27","doi-asserted-by":"crossref","unstructured":"Hoda, S., Van Hoeve, W.-J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: International Conference on Principles and Practice of Constraint Programming. Springer, pp. 266\u2013280 (2010)","DOI":"10.1007\/978-3-642-15396-9_23"},{"issue":"3","key":"191_CR28","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ejor.2016.11.035","volume":"259","author":"J Kinable","year":"2017","unstructured":"Kinable, J., Cire, A.A., van Hoeve, W.-J.: Hybrid optimization methods for time-dependent sequencing problems. Eur. J. Oper. Res. 259(3), 887\u2013897 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"191_CR29","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/43.298033","volume":"13","author":"Y-T Lai","year":"1994","unstructured":"Lai, Y.-T., Pedram, M., Vrudhula, S.B.: EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(8), 959\u2013975 (1994)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"191_CR30","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 Syst. Tech. J. 38(4), 985\u2013999 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"191_CR31","doi-asserted-by":"crossref","unstructured":"Lozano, L., Smith, J.C.: A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs. In: Mathematical Programming, pp. 1\u201324 (2018)","DOI":"10.1007\/s10107-018-1315-z"},{"key":"191_CR32","unstructured":"MIPLIB 2017. http:\/\/miplib.zib.de (2018). Accessed 14 Dec 2018"},{"issue":"3","key":"191_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.orl.2019.03.008","volume":"47","author":"RJ O\u2019Neil","year":"2019","unstructured":"O\u2019Neil, R.J., Hoffman, K.: Decision diagrams for solving traveling salesman problems with pickup and delivery in real time. Oper. Res. Lett. 47(3), 197\u2013201 (2019)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"191_CR34","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MW Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"issue":"2","key":"191_CR35","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"191_CR36","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/ijoc.2018.0830","volume":"31","author":"C Tjandraatmadja","year":"2019","unstructured":"Tjandraatmadja, C., van Hoeve, W.-J.: Target cuts from relaxed decision diagrams. INFORMS J. Comput. 31(2), 285\u2013301 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"6684","key":"191_CR37","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"191_CR38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams: Theory and Applications","author":"I Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications, vol. 4. SIAM, Philadelphia (2000)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00191-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-020-00191-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00191-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T09:29:47Z","timestamp":1622539787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-020-00191-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["191"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00191-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"5 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}