Pages that link to "Item:Q5166291"

The following pages link to Multivalued Decision Diagrams for Sequencing Problems (Q5166291):

Displaying 36 items.

• Projection, consistency, and George Boole (Q265702) (← links)
• Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
• Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
• Lagrangian bounds from decision diagrams (Q890004) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← 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 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)
• Stochastic decision diagrams (Q2170193) (← 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)
• Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← 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)
• BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
• Discrete Optimization with Decision Diagrams (Q2806864) (← links)
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← 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)
• Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
• Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)