Improving the filtering of branch-and-bound MDD solver

DOI10.1007/978-3-030-78230-6_15MaRDI QIDQ2117223zbMATH OpenOpenAlexFDO

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

Publication date 21 March 2022

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

Mathematics Subject Classification ID

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

Cites work

• \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
• A compressed-annealing heuristic for the traveling salesman problem with time windows
• A generalized insertion heuristic for the travelling salesman problem with time windows
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Beam-ACO for the travelling salesman problem with time windows
• Decision diagrams and dynamic programming
• Discrete optimization with decision diagrams
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 870411 (Why is no real title available?)
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Introduction to algorithms.
• On finding the optimal BDD relaxation
• Optimization Bounds from Binary Decision Diagrams
• Outer approximation for integer nonlinear programs via decision diagrams
• Parallel Combinatorial Optimization with Decision Diagrams
• Symbolic model checking: \(10^{20}\) states and beyond
• Target cuts from relaxed decision diagrams
• The theory of dynamic programming
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Theoretical insights and algorithmic tools for decision diagram-based optimization

Cited in

(7)

• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Optimization bounds from decision diagrams in Haddock
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
• Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
• Domain-independent dynamic programming
• Beware of the classical benchmark instances for the traveling salesman problem with time windows
• Improvement of FPPR method to solve ECDLP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117223)