The following pages link to Decision diagrams for optimization (Q341068):
Displaying 42 items.
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Auto-tabling for subproblem presolving in MiniZinc (Q1701238) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- On finding the optimal BDD relaxation (Q2011572) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
- MDDs boost equation solving on discrete dynamical systems (Q2117218) (← links)
- Checking constraint satisfaction (Q2117234) (← links)
- Improving branch-and-bound using decision diagrams and reinforcement learning (Q2117248) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- Learning pseudo-backdoors for mixed integer programs (Q2170189) (← links)
- Stochastic decision diagrams (Q2170193) (← links)
- Efficient operations between MDDs and constraints (Q2170195) (← links)
- Dealing with the product constraint (Q2170204) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- From MDD to BDD and arc consistency (Q2331100) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- (Q3783792) (← links)
- (Q4292762) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
- Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
- Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning (Q5058000) (← links)
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling (Q5084615) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- Interactive Cost Configuration Over Decision Diagrams (Q5190268) (← links)
- Column elimination for capacitated vehicle routing problems (Q6057244) (← links)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)
- Bddl: A Type System for Binary Decision Diagrams (Q6487291) (← links)
- Extended formulations via decision diagrams (Q6591617) (← links)
- Valued constraint satisfaction problems (Q6602254) (← links)
