Approximation schemes for multiperiod binary knapsack problems
From MaRDI portal
Publication:2117082
DOI10.1007/978-3-030-79416-3_8OpenAlexW3175902277MaRDI QIDQ2117082FDOQ2117082
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2104.00034
Cites Work
- Title not available (Why is that?)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- An Incremental Model for Combinatorial Maximization Problems
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- Unbounded knapsack problem: Dynamic programming revisited
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Large-scale multi-period precedence constrained knapsack problem: a mining application
- A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
- Technical Note—The Multiperiod Knapsack Problem
- The multiple-choice multi-period knapsack problem
- Title not available (Why is that?)
- A PTAS for the time-invariant incremental knapsack problem
- On approximating the incremental knapsack problem
- Title not available (Why is that?)
Cited In (5)
- An approximate binary search algorithm for the multiple-choice knapsack problem
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Approximating the 3-period incremental knapsack problem
- Title not available (Why is that?)
- On the multiperiod binary knapsack problem
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)
