Discrete Optimization with Decision Diagrams
From MaRDI portal
Publication:2806864
DOI10.1287/ijoc.2015.0648zbMath1338.90260OpenAlexW2187140470MaRDI QIDQ2806864
No author found.
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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39)
Related Items (40)
Projection, consistency, and George Boole ⋮ Constraint programming and operations research ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Stochastic decision diagrams ⋮ Efficient operations between MDDs and constraints ⋮ Strong relaxations for continuous nonlinear programs based on decision diagrams ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ BDD-based optimization for the quadratic stable set problem ⋮ Continuous cutting plane algorithms in integer programming ⋮ Optimization bounds from decision diagrams in Haddock ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ Compact representation of near-optimal integer programming solutions ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ On the Consistent Path Problem ⋮ Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores ⋮ On finding the optimal BDD relaxation ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ Decision diagrams for solving traveling salesman problems with pickup and delivery in real time ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Implementing Efficient All Solutions SAT Solvers ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem ⋮ Improving the filtering of branch-and-bound MDD solver ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Iterative and core-guided maxsat solving: a survey and assessment
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- Pruning Moves
- Decorous Lower Bounds for Minimum Linear Arrangement
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- State-space relaxation procedures for the computation of bounds to routing problems
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Binary Decision Diagrams
- Randomized heuristics for the Max-Cut problem
- Branching Programs and Binary Decision Diagrams
- A Spectral Bundle Method for Semidefinite Programming
- Graph Partitioning and Continuous Quadratic Programming
- Decision Diagrams and Dynamic Programming
- An MDD Approach to Multidimensional Bin Packing
- Multivalued Decision Diagrams for Sequencing Problems
- Experimental and Efficient Algorithms
This page was built for publication: Discrete Optimization with Decision Diagrams
