Incorporating bounds from decision diagrams into integer programming
From MaRDI portal
Publication:823882
DOI10.1007/s12532-020-00191-6zbMath1476.90202OpenAlexW3096869031MaRDI QIDQ823882
Christian Tjandraatmadja, Willem-Jan van Hoeve
Publication date: 16 December 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-020-00191-6
Related Items (3)
Stochastic decision diagrams ⋮ Efficient operations between MDDs and constraints ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
Uses Software
Cites Work
- Unnamed Item
- Decision diagrams for optimization
- SCIP: solving constraint integer programs
- Lagrangian bounds from decision diagrams
- Constraint propagation with interval labels
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Hybrid optimization methods for time-dependent sequencing problems
- Conflict graphs in solving integer programming problems
- Outer approximation for integer nonlinear programs via decision diagrams
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Conflict analysis in mixed integer programming
- Discrete Optimization with Decision Diagrams
- Decomposition Based on Decision Diagrams
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Presolve Reductions in Mixed Integer Programming
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Branching Programs and Binary Decision Diagrams
- Target Cuts from Relaxed Decision Diagrams
- Multivalued Decision Diagrams for Sequencing Problems
- Collective dynamics of ‘small-world’ networks
- Depth-First Search and Linear Graph Algorithms
- Experimental and Efficient Algorithms
This page was built for publication: Incorporating bounds from decision diagrams into integer programming
