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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 198; číslo 1; s. 27 - 83
Hlavní autori:	Faenza, Yuri, Segev, Danny, Zhang, Lingyi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023 Springer
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!