Improving the filtering of branch-and-bound MDD solver

DOI10.1007/978-3-030-78230-6_15OpenAlexW3169085602MaRDI QIDQ2117223

Pierre Schaus, Vianney Coppé, Andre A. Cire, Xavier Gillard

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2104.11951

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic model checking: \(10^{20}\) states and beyond
• 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
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Beam-ACO for the travelling salesman problem with time windows
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• 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
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Optimization Bounds from Binary Decision Diagrams
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Decision Diagrams and Dynamic Programming
• Target Cuts from Relaxed Decision Diagrams
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Parallel Combinatorial Optimization with Decision Diagrams
• The theory of dynamic programming

This page was built for publication: Improving the filtering of branch-and-bound MDD solver