Target cuts from relaxed decision diagrams

DOI10.1287/IJOC.2018.0830zbMATH Open1474.90291OpenAlexW2939087242MaRDI QIDQ5138261FDOQ5138261

Authors: Tjandraatmadja Christian, Van Hoeve Willem-Jan 

Publication date: 3 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/21f5ca135c73afcca1512475fef119ea6f9add86

Recommendations

• Discrete optimization with decision diagrams
• Outer approximation for integer nonlinear programs via decision diagrams
• Incorporating bounds from decision diagrams into integer programming
• On disjunctive cuts for combinatorial optimization
• Optimization Bounds from Binary Decision Diagrams

zbMATH Keywords

integer programmingcutting planesdecision diagrams

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Title not available (Why is that?)
• Discrete optimization with decision diagrams
• Manipulating MDD relaxations for combinatorial optimization
• Branching Programs and Binary Decision Diagrams
• Multivalued decision diagrams for sequencing problems
• An exact algorithm for robust network design
• Binary Decision Diagrams
• On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
• An MDD approach to multidimensional bin packing
• Optimization Bounds from Binary Decision Diagrams
• Decision diagrams for optimization
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Local cuts revisited
• Lifting and separation procedures for the cut polytope
• Title not available (Why is that?)
• Polyhedral Characterization of Discrete Dynamic Programming
• Reflections on generating (disjunctive) cuts
• Experimental and Efficient Algorithms
• Engineering branch-and-cut algorithms for the equicut problem
• Local cuts for mixed-integer programming

Cited In (11)

• Incorporating bounds from decision diagrams into integer programming
• Constraint programming and operations research
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Outer approximation for integer nonlinear programs via decision diagrams
• Strong relaxations for continuous nonlinear programs based on decision diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• On the consistent path problem
• Improving the filtering of branch-and-bound MDD solver
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• BDD-based optimization for the quadratic stable set problem

This page was built for publication: Target cuts from relaxed decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138261)