Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams

DOI10.1613/jair.1.14607arXiv2302.05483OpenAlexW4385828179MaRDI QIDQ6426110

Louis-Martin Rousseau, Isaac Rudich, Quentin Cappart

Publication date: 10 February 2023

Full work available at URL: https://doi.org/10.1613/jair.1.14607

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

Unnamed Item
Decision diagrams for optimization
Constraint-based scheduling: Applying constraint programming to scheduling problems.
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
Variable ordering for decision diagrams: a portfolio approach
Compact representation of near-optimal integer programming solutions
From MDD to BDD and arc consistency
Compiling CP subproblems to MDDs and d-DNNFs
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
Discrete Optimization with Decision Diagrams
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
Optimization Bounds from Binary Decision Diagrams
Manipulating MDD Relaxations for Combinatorial Optimization
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
TSPLIB—A Traveling Salesman Problem Library
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics
Multivalued Decision Diagrams for Sequencing Problems
The Vehicle Routing Problem with Time Windows Part II: Genetic Search
Parallel Combinatorial Optimization with Decision Diagrams

This page was built for publication: Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams