\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
From MaRDI portal
Publication:2026989
DOI10.1016/j.cor.2020.105125OpenAlexW2906165405MaRDI QIDQ2026989
Elina Rönnberg, Johannes Maschler, Matthias Horn, Günther R. Raidl
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105125
Related Items (5)
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem ⋮ Improving the filtering of branch-and-bound MDD solver
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Decision diagrams for optimization
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
- A local search framework for compiling relaxed decision diagrams
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Hybrid optimization methods for time-dependent sequencing problems
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Assortment optimization over time
- On finding the optimal BDD relaxation
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
- Discrete Optimization with Decision Diagrams
- Optimization Bounds from Binary Decision Diagrams
- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space
- Graph-Based Algorithms for Boolean Function Manipulation
- State-space relaxation procedures for the computation of bounds to routing problems
- Decision Diagrams and Dynamic Programming
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Multivalued Decision Diagrams for Sequencing Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
