Multivalued Decision Diagrams for Sequencing Problems
From MaRDI portal
Publication:5166291
DOI10.1287/opre.2013.1221zbMath1291.90091OpenAlexW4240544076MaRDI QIDQ5166291
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
Related Items (36)
Projection, consistency, and George Boole ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Stochastic decision diagrams ⋮ Strong relaxations for continuous nonlinear programs based on decision diagrams ⋮ Network Models for Multiobjective Discrete Optimization ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ BDD-based optimization for the quadratic stable set problem ⋮ Lagrangian bounds from decision diagrams ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Discrete Optimization with Decision Diagrams ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ Decision diagrams for solving traveling salesman problems with pickup and delivery in real time ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ 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
This page was built for publication: Multivalued Decision Diagrams for Sequencing Problems
