Approximation algorithms for the generalized incremental knapsack problem

We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack . In this setting, we are given a set of n items, each associated with a non-negative weight, and T time periods with non-decreasing capacities W 1 ≤ ⋯ ≤ W T . When ite...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 198; no. 1; pp. 27 - 83
Main Authors:	Faenza, Yuri, Segev, Danny, Zhang, Lingyi
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023 Springer
Subjects:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 90C10 Approximation algorithms 68W25 Sequencing Incremental optimization 90B35
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!