Approximation schemes for multiperiod binary knapsack problems
type: Item
instance of: scholarly article
title: Approximation schemes for multiperiod binary knapsack problems
DOI: 10.1007/978-3-030-79416-3_8
author: Yanyan Li
publication date: 2022-03-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2104.00034
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493528
zbMATH Keywords: approximation algorithms
zbMATH Keywords: knapsack problem
zbMATH Keywords: optimization
MaRDI profile type: Publication
OpenAlex ID: W3175902277
cites work: Unbounded knapsack problem: Dynamic programming revisited
cites work: Q5240419
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: On approximating the incremental knapsack problem
cites work: Technical Note—The Multiperiod Knapsack Problem
cites work: A PTAS for the time-invariant incremental knapsack problem
cites work: An Incremental Model for Combinatorial Maximization Problems
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: A Fast Approximation Scheme for the Multiple Knapsack Problem
cites work: Q5091235
cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem
cites work: Q4821303
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code
cites work: The multiple-choice multi-period knapsack problem
cites work: Large-scale multi-period precedence constrained knapsack problem: a mining application
description: scientific article; zbMATH DE number 7493528