Target Cuts from Relaxed Decision Diagrams

References

• Akers SB (1978) Binary decision diagrams. IEEE Trans. Comput. 100(6):509–516.Crossref, Google Scholar
• Andersen HR, Hadzic T, Hooker JN, Tiedemann P (2007) A constraint store based on multivalued decision diagrams. Bessière C, ed. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 4741 (Springer, Berlin, Heidelberg), 118–132.Crossref, Google Scholar
• Anjos MF, Liers F, Pardella G, Schmutzer A (2013) Engineering branch-and-cut algorithms for the equicut problem. Bezdek K, Deza A, Ye Y, eds. Discrete Geometry and Optimization, Fields Institute Communications, vol. 69 (Springer, Berlin, Heidelberg), 17–32.Crossref, Google Scholar
• Becker B, Behle M, Eisenbrand F, Wimmer R (2005) BDDs in a branch and cut framework. Nikoletseas SE, ed. Experimental and Efficient Algorithms, Lecture Notes in Computer Science, vol. 3503 (Springer, Berlin, Heidelberg), 452–463.Crossref, Google Scholar
• Behle M (2007) Binary decision diagrams and integer programming. PhD thesis, Max Planck Institute for Computer Science, Saarbrücken, Germany.Google Scholar
• Bergman D, van Hoeve WJ, Hooker JN (2011) Manipulating MDD relaxations for combinatorial optimization. Achterberg T, Beck JC, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 6697 (Springer, Berlin, Heidelberg), 20–35.Crossref, Google Scholar
• Bergman D, Cire AA, van Hoeve WJ, Hooker JN (2013) Optimization bounds from binary decision diagrams. INFORMS J. Comput. 26(2):253–268.Link, Google Scholar
• Bergman D, Cire AA, van Hoeve WJ, Hooker JN (2016a) Decision Diagrams for Optimization (Springer International Publishing, Cham, Switzerland).Crossref, Google Scholar
• Bergman D, Cire AA, van Hoeve WJ, Hooker JN (2016b) Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1):47–66.Link, Google Scholar
• Bonato T, Jünger M, Reinelt G, Rinaldi G (2014) Lifting and separation procedures for the cut polytope. Math. Programming 146(1-2):351–378.Crossref, Google Scholar
• Boyd EA (1995) On the convergence of Fenchel cutting planes in mixed-integer programming. SIAM J. Optim. 5(2):421–435.Crossref, Google Scholar
• Bryant RE (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8):677–691.Crossref, Google Scholar
• Buchheim C, Liers F, Oswald M (2008) Local cuts revisited. Oper. Res. Lett. 36(4):430–433.Crossref, Google Scholar
• Buchheim C, Liers F, Oswald M (2010) Speeding up IP-based algorithms for constrained quadratic 0–1 optimization. Math. Programming 124(1–2):513–535.Crossref, Google Scholar
• Buchheim C, Liers F, Sanità L (2011) An exact algorithm for robust network design. Pahl J, Reiners T, Voß S, eds. Network Optimization, Lecture Notes in Computer Science, vol. 6701 (Springer, Berlin, Heidelberg), 7–17.Crossref, Google Scholar
• Cadoux F, Lemaréchal C (2013) Reflections on generating (disjunctive) cuts. EURO J. Comput. Optim. 1(1–2):51–69.Crossref, Google Scholar
• Chvátal V, Cook W, Espinoza D (2013) Local cuts for mixed-integer programming. Math. Programming Comput. 5(2):171–200.Crossref, Google Scholar
• Cire AA, van Hoeve WJ (2013) Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6):1411–1428.Link, Google Scholar
• Hiriart-Urruty JB, Lemaréchal C (2001) Fundamentals of Convex Analysis (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
• Kell B, van Hoeve WJ (2013) An MDD approach to multidimensional bin packing. Gomes C, Sellmann M, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 7874 (Springer, Berlin, Heidelberg), 128–143.Crossref, Google Scholar
• Knuth DE (2011) The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 (Addison-Wesley Professional, Reading, MA).Google Scholar
• Lee CY (1959) Representation of switching circuits by binary-decision programs. Bell System Tech. J. 38(4):985–999.Crossref, Google Scholar
• Martin RK, Rardin RL, Campbell BA (1990) Polyhedral characterization of discrete dynamic programming. Oper. Res. 38(1):127–138.Link, Google Scholar
• Minato S (1993) Zero-suppressed BDDs for set manipulation in combinatorial problems. Proc. 30th Conf. on Design Automation (IACM/IEEE, Dallas), 272–277.Crossref, Google Scholar
• Schrijver A (1986) Theory of Linear and Integer Programming (John Wiley & Sons, Inc., New York).Google Scholar
• Wegener I (2000) Branching Programs and Binary Decision Diagrams: Theory and Applications, vol. 4 (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar