Multivalued decision diagrams for sequencing problems
From MaRDI portal
Publication:5166291
Recommendations
Cited in
(38)- Decision diagrams for solving a job scheduling problem under precedence constraints
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- 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
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Hybrid optimization methods for time-dependent sequencing problems
- Outer approximation for integer nonlinear programs via decision diagrams
- Incorporating bounds from decision diagrams into integer programming
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Solving the single crane scheduling problem at rail transshipment yards
- scientific article; zbMATH DE number 6930340 (Why is no real title available?)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Network Models for Multiobjective Discrete Optimization
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- Compiling CP subproblems to MDDs and d-DNNFs
- Multi-machine scheduling lower bounds using decision diagrams
- Target cuts from relaxed decision diagrams
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- An MDD approach to multidimensional bin packing
- Network-based approximate linear programming for discrete optimization
- Discrete optimization with decision diagrams
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Lagrangian bounds from decision diagrams
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Projection, consistency, and George Boole
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Load-dependent and precedence-based models for pickup and delivery problems
- BDD-based optimization for the quadratic stable set problem
- Stochastic decision diagrams
This page was built for publication: Multivalued decision diagrams for sequencing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166291)
