Pages that link to "Item:Q2806864"

The following pages link to Discrete Optimization with Decision Diagrams (Q2806864):

Displaying 39 items.

• Projection, consistency, and George Boole (Q265702) (← links)
• Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
• Constraint programming and operations research (Q1616390) (← links)
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
• Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores (Q1753430) (← 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)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
• Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
• Improving branch-and-bound using decision diagrams and reinforcement learning (Q2117248) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Graph coloring with decision diagrams (Q2118148) (← links)
• Stochastic decision diagrams (Q2170193) (← links)
• Efficient operations between MDDs and constraints (Q2170195) (← links)
• Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
• Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
• Decision diagrams for solving traveling salesman problems with pickup and delivery in real time (Q2294298) (← links)
• Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
• Theoretical insights and algorithmic tools for decision diagram-based optimization (Q2398513) (← links)
• Strong relaxations for continuous nonlinear programs based on decision diagrams (Q2661626) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
• BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
• Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning (Q5058000) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
• Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
• On the Consistent Path Problem (Q5144803) (← links)
• Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
• Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)