Decision diagrams for optimization
From MaRDI portal
Publication:341068
DOI10.1007/978-3-319-42849-9zbMathNoneOpenAlexW1700954517MaRDI QIDQ341068
Publication date: 15 November 2016
Published in: Artificial Intelligence: Foundations, Theory, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42849-9
Applications of mathematical programming (90C90) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (36)
Constraint programming and operations research ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Graph Coloring Lower Bounds from Decision Diagrams ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Variable ordering for decision diagrams: a portfolio approach ⋮ Learning pseudo-backdoors for mixed integer programs ⋮ Stochastic decision diagrams ⋮ Efficient operations between MDDs and constraints ⋮ Dealing with the product constraint ⋮ Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ BDD-based optimization for the quadratic stable set problem ⋮ Column elimination for capacitated vehicle routing problems ⋮ Optimization bounds from decision diagrams in Haddock ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ Auto-tabling for subproblem presolving in MiniZinc ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ On the Consistent Path Problem ⋮ 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 ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ A beam search approach to the traveling tournament problem ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization ⋮ From MDD to BDD and arc consistency ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem ⋮ MDDs boost equation solving on discrete dynamical systems ⋮ Checking constraint satisfaction ⋮ Improving branch-and-bound using decision diagrams and reinforcement learning ⋮ Graph coloring with decision diagrams
This page was built for publication: Decision diagrams for optimization
