Multivalued decision diagrams for sequencing problems
From MaRDI portal
Publication:5166291
DOI10.1287/OPRE.2013.1221zbMATH Open1291.90091OpenAlexW4240544076MaRDI QIDQ5166291FDOQ5166291
Andre A. Cire, Willem-Jan van Hoeve
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2013.1221
Recommendations
Cited In (37)
- Incorporating bounds from decision diagrams into integer programming
- Title not available (Why is that?)
- Lagrangian bounds from decision diagrams
- Projection, consistency, and George Boole
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Decision diagrams for solving a job scheduling problem under precedence constraints
- 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
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Hybrid optimization methods for time-dependent sequencing problems
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
- Outer approximation for integer nonlinear programs via decision diagrams
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- Multi-machine scheduling lower bounds using decision diagrams
- Load-dependent and precedence-based models for pickup and delivery problems
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Network Models for Multiobjective Discrete Optimization
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Stochastic decision diagrams
- Discrete optimization with decision diagrams
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- BDD-based optimization for the quadratic stable set problem
- Network-Based Approximate Linear Programming for Discrete Optimization
- Target Cuts from Relaxed Decision Diagrams
- Solving the single crane scheduling problem at rail transshipment yards
- Compiling CP subproblems to MDDs and d-DNNFs
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)
