Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
From MaRDI portal
Cites work
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Approximability of flow shop scheduling
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Quantum complexity theory
- Quantum random access memory
- Quantum speedup for the minimum Steiner tree problem
- Quantum speedups for exponential-time dynamic programming algorithms
- Scheduling partially ordered jobs faster than \(2^n\)
- Scheduling. Theory, algorithms, and systems.
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982466)
