Approximation schemes for multiperiod binary knapsack problems

DOI10.1007/978-3-030-79416-3_8OpenAlexW3175902277MaRDI QIDQ2117082

Yanyan Li

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2104.00034

zbMATH Keywords

optimizationknapsack problemapproximation algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unbounded knapsack problem: Dynamic programming revisited
• A PTAS for the time-invariant incremental knapsack problem
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• On approximating the incremental knapsack problem
• Large-scale multi-period precedence constrained knapsack problem: A mining application
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
• Fast Approximation Algorithms for Knapsack Problems
• Technical Note—The Multiperiod Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• The multiple-choice multi-period knapsack problem
• An Incremental Model for Combinatorial Maximization Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Approximation schemes for multiperiod binary knapsack problems