Discrete optimization with decision diagrams
From MaRDI portal
Publication:2806864
DOI10.1287/IJOC.2015.0648zbMATH Open1338.90260OpenAlexW2187140470MaRDI QIDQ2806864FDOQ2806864
Authors: David Bergman, Andre A. Cire, Willem-Jan van Hoeve, John N. Hooker 
Publication date: 19 May 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1807/78979
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39) Integer programming (90C10)
Cites Work
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A Spectral Bundle Method for Semidefinite Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Manipulating MDD relaxations for combinatorial optimization
- Branching Programs and Binary Decision Diagrams
- Multivalued Decision Diagrams for Sequencing Problems
- A fast algorithm for the maximum clique problem
- Iterative and core-guided maxsat solving: a survey and assessment
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Binary Decision Diagrams
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- State-space relaxation procedures for the computation of bounds to routing problems
- New state-space relaxations for solving the traveling salesman problem with time windows
- Decorous lower bounds for minimum linear arrangement
- Randomized heuristics for the Max-Cut problem
- An MDD approach to multidimensional bin packing
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Optimization Bounds from Binary Decision Diagrams
- Decision diagrams and dynamic programming
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Graph Partitioning and Continuous Quadratic Programming
- Title not available (Why is that?)
- Pruning moves
- Experimental and Efficient Algorithms
- Title not available (Why is that?)
Cited In (46)
- Incorporating bounds from decision diagrams into integer programming
- Projection, consistency, and George Boole
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Constraint programming and operations research
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- Improving branch-and-bound using decision diagrams and reinforcement learning
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Graph coloring with decision diagrams
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- On finding the optimal BDD relaxation
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Compact representation of near-optimal integer programming solutions
- Outer approximation for integer nonlinear programs via decision diagrams
- On the Consistent Path Problem
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Optimization bounds from decision diagrams in Haddock
- Manipulating MDD relaxations for combinatorial optimization
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Multi-machine scheduling lower bounds using decision diagrams
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Stochastic decision diagrams
- Decision diagrams for optimization
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
- Efficient operations between MDDs and constraints
- 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
- Implementing Efficient All Solutions SAT Solvers
- Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning
- Target Cuts from Relaxed Decision Diagrams
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Continuous cutting plane algorithms in integer programming
- Compiling CP subproblems to MDDs and d-DNNFs
- Interactive Cost Configuration Over Decision Diagrams
- Experimental and Efficient Algorithms
Uses Software
This page was built for publication: Discrete optimization with decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806864)
