Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
From MaRDI portal
Publication:5106421
DOI10.1287/IJOC.2022.1170OpenAlexW4221014517MaRDI QIDQ5106421
Andre A. Cire, J. Christopher Beck, Margarita P. Castro
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11536
Related Items (3)
ZDD-based algorithmic framework for solving shortest reconfiguration problems ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Decision diagrams for optimization
- MDD propagators with explanation
- Compact representations of all members of an independence system
- Incorporating bounds from decision diagrams into integer programming
- Lagrangian bounds from decision diagrams
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
- Valid inequalities for mixed integer linear programs
- On threshold BDDs and the optimal variable ordering problem
- Partitioning procedures for solving mixed-variables programming problems
- A local search framework for compiling relaxed decision diagrams
- Hybrid optimization methods for time-dependent sequencing problems
- MDDs are efficient modeling tools: an application to some statistical constraints
- 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
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Enumerative branching with less repetition
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- Improving the filtering of branch-and-bound MDD solver
- Checking constraint satisfaction
- 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
- 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
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Multi-machine scheduling lower bounds using decision diagrams
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Exact computation of strongly connected reliability by binary decision diagrams
- Binary decision diagrams for bin packing with minimum color fragmentation
- Last-mile scheduling under uncertainty
- Extending compact-diagram to basic smart multi-valued variable diagrams
- Embedding decision diagrams into generative adversarial networks
- From MDD to BDD and arc consistency
- Compiling CP subproblems to MDDs and d-DNNFs
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- BDD-based optimization for the quadratic stable set problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Discrete Optimization with Decision Diagrams
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
- Decomposition Based on Decision Diagrams
- Constructions and In-Place Operations for MDDs Based Constraints
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Integer Programming
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- State-space relaxation procedures for the computation of bounds to routing problems
- Binary Decision Diagrams
- Improving the variable ordering of OBDDs is NP-complete
- Branching Programs and Binary Decision Diagrams
- Decision Diagrams and Dynamic Programming
- An MDD Approach to Multidimensional Bin Packing
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Graph Coloring Lower Bounds from Decision Diagrams
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Target Cuts from Relaxed Decision Diagrams
- Network-Based Approximate Linear Programming for Discrete Optimization
- On the Consistent Path Problem
- Multivalued Decision Diagrams for Sequencing Problems
- 0/1 vertex and facet enumeration with BDDs
- Parallel Combinatorial Optimization with Decision Diagrams
- MDD Propagation for Sequence Constraints
- Experimental and Efficient Algorithms
- BDD-Guided Clause Generation
This page was built for publication: Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
