Target Cuts from Relaxed Decision Diagrams

The most common approach to generate cuts in integer programming is to derive them from the linear programming relaxation. We study an alternative approach that extracts cuts from discrete relaxati...

[1]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[2]  Bernd Becker,et al.  BDDs in a Branch and Cut Framework , 2005, WEA.

[3]  André Augusto Ciré,et al.  Multivalued Decision Diagrams for Sequencing Problems , 2013, Oper. Res..

[4]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[5]  Claude Lemaréchal,et al.  Reflections on generating (disjunctive) cuts , 2013, EURO J. Comput. Optim..

[6]  Christoph Buchheim,et al.  An Exact Algorithm for Robust Network Design , 2011, INOC.

[7]  David Bergman,et al.  Discrete Optimization with Decision Diagrams , 2016, INFORMS J. Comput..

[8]  Michael Jünger,et al.  Lifting and separation procedures for the cut polytope , 2014, Math. Program..

[9]  John N. Hooker,et al.  A Constraint Store Based on Multivalued Decision Diagrams , 2007, CP.

[10]  Ronald L. Rardin,et al.  Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..

[11]  Markus Behle,et al.  Binary decision diagrams and integer programming , 2007 .

[12]  Marcus Oswald,et al.  Local cuts revisited , 2008, Oper. Res. Lett..

[13]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[14]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[15]  Marcus Oswald,et al.  Speeding up IP-based algorithms for constrained quadratic 0–1 optimization , 2010, Math. Program..

[16]  David Bergman,et al.  Manipulating MDD Relaxations for Combinatorial Optimization , 2011, CPAIOR.

[17]  Willem Jan van Hoeve,et al.  An MDD Approach to Multidimensional Bin Packing , 2013, CPAIOR.

[18]  Miguel F. Anjos,et al.  Engineering Branch-and-Cut Algorithms for the Equicut Problem , 2013 .

[19]  J. Hiriart-Urruty,et al.  Fundamentals of Convex Analysis , 2004 .

[20]  David Bergman,et al.  Optimization Bounds from Binary Decision Diagrams , 2014, INFORMS J. Comput..

[21]  William J. Cook,et al.  Local cuts for mixed-integer programming , 2013, Math. Program. Comput..

[22]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[23]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[24]  E. Andrew Boyd.  On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming , 1995, SIAM J. Optim..