Discrete optimization with decision diagrams
From MaRDI portal
(Redirected from Publication:2806864)
Recommendations
Cites work
- A fast algorithm for the maximum clique problem
- A Spectral Bundle Method for Semidefinite Programming
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An MDD approach to multidimensional bin packing
- Binary Decision Diagrams
- Branching Programs and Binary Decision Diagrams
- Clique relaxations in social network analysis: the maximum k-plex problem
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Decision diagrams and dynamic programming
- Decorous lower bounds for minimum linear arrangement
- Experimental and Efficient Algorithms
- Graph Partitioning and Continuous Quadratic Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 2086966 (Why is no real title available?)
- scientific article; zbMATH DE number 1423226 (Why is no real title available?)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Iterative and core-guided maxsat solving: a survey and assessment
- Manipulating MDD relaxations for combinatorial optimization
- Multivalued decision diagrams for sequencing problems
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- New state-space relaxations for solving the traveling salesman problem with time windows
- Optimization Bounds from Binary Decision Diagrams
- Pruning moves
- Randomized heuristics for the Max-Cut problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- State-space relaxation procedures for the computation of bounds to routing problems
- The Power of Dominance Relations in Branch-and-Bound Algorithms
Cited in
(55)- Constraint programming and operations research
- A local search framework for compiling relaxed decision diagrams
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores
- 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
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- Improving the filtering of branch-and-bound MDD solver
- 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
- Stochastic decision diagrams
- Efficient operations between MDDs and constraints
- 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
- Multi-machine scheduling lower bounds using decision diagrams
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Compiling CP subproblems to MDDs and d-DNNFs
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Projection, consistency, and George Boole
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- BDD-based optimization for the quadratic stable set problem
- Decomposition based on decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- Decision diagrams for optimization
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Compact representations of all members of an independence system
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Target cuts from relaxed decision diagrams
- On the consistent path problem
- Interactive Cost Configuration Over Decision Diagrams
- Implementing efficient All solutions SAT solvers
- Experimental and Efficient Algorithms
- Continuous cutting plane algorithms in integer programming
- Optimization bounds from decision diagrams in Haddock
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
- Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
- A dynamic programming approach for the job sequencing and tool switching problem
- Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
- Domain-independent dynamic programming
- Incorporating bounds from decision diagrams into integer programming
- Lagrangian bounds from decision diagrams
This page was built for publication: Discrete optimization with decision diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806864)
