Approximation schemes for multiperiod binary knapsack problems
From MaRDI portal
Publication:2117082
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- A PTAS for the time-invariant incremental knapsack problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- An Incremental Model for Combinatorial Maximization Problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- On approximating the incremental knapsack problem
- Technical Note—The Multiperiod Knapsack Problem
- The multiple-choice multi-period knapsack problem
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(5)- On the multiperiod binary knapsack problem
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Approximating the 3-period incremental knapsack problem
- An approximate binary search algorithm for the multiple-choice knapsack problem
- scientific article; zbMATH DE number 3900493 (Why is no real title available?)
This page was built for publication: Approximation schemes for multiperiod binary knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117082)
