Incorporating bounds from decision diagrams into integer programming
From MaRDI portal
Recommendations
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Outer approximation for integer nonlinear programs via decision diagrams
- Lagrangian bounds from decision diagrams
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Discrete optimization with decision diagrams
Cites work
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Binary Decision Diagrams
- Branching Programs and Binary Decision Diagrams
- Collective dynamics of `small-world' networks
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Constraint propagation with interval labels
- Decision diagrams for optimization
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Decomposition based on decision diagrams
- Depth-First Search and Linear Graph Algorithms
- Discrete optimization with decision diagrams
- Experimental and Efficient Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- Hybrid optimization methods for time-dependent sequencing problems
- Lagrangian bounds from decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- Multivalued decision diagrams for sequencing problems
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Optimization Bounds from Binary Decision Diagrams
- Outer approximation for integer nonlinear programs via decision diagrams
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Reductions in Mixed Integer Programming
- SCIP: solving constraint integer programs
- Target cuts from relaxed decision diagrams
Cited in
(11)- Graph coloring with decision diagrams
- Outer approximation for integer nonlinear programs via decision diagrams
- Optimization Bounds from Binary Decision Diagrams
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Target cuts from relaxed decision diagrams
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- Efficient operations between MDDs and constraints
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Lagrangian bounds from decision diagrams
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Stochastic decision diagrams
This page was built for publication: Incorporating bounds from decision diagrams into integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q823882)
