License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.15
URN: urn:nbn:de:0030-drops-147081
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14708/
Go to the corresponding LIPIcs Volume Portal


Fairstein, Yaron ; Kulik, Ariel ; Naor, Joseph (Seffi) ; Raz, Danny

General Knapsack Problems in a Dynamic Setting

pdf-format:
LIPIcs-APPROX15.pdf (0.7 MB)


Abstract

The world is dynamic and changes over time, thus any optimization problem used to model real life problems must address this dynamic nature, taking into account the cost of changes to a solution over time. The multistage model was introduced with this goal in mind. In this model we are given a series of instances of an optimization problem, corresponding to different times, and a solution is provided for each instance. The strive for obtaining near-optimal solutions for each instance on one hand, while maintaining similar solutions for consecutive time units on the other hand, is quantified and integrated into the objective function. In this paper we consider the Generalized Multistage d-Knapsack problem, a generalization of the multistage variants of the Multiple Knapsack problem, as well as the d-Dimensional Knapsack problem. We present a PTAS for Generalized Multistage d-Knapsack.

BibTeX - Entry

@InProceedings{fairstein_et_al:LIPIcs.APPROX/RANDOM.2021.15,
  author =	{Fairstein, Yaron and Kulik, Ariel and Naor, Joseph (Seffi) and Raz, Danny},
  title =	{{General Knapsack Problems in a Dynamic Setting}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
  pages =	{15:1--15:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-207-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{207},
  editor =	{Wootters, Mary and Sanit\`{a}, Laura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14708},
  URN =		{urn:nbn:de:0030-drops-147081},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2021.15},
  annote =	{Keywords: Multistage, Multiple-Knapsacks, Multidimensional Knapsack}
}

Keywords: Multistage, Multiple-Knapsacks, Multidimensional Knapsack
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Issue Date: 2021
Date of publication: 15.09.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI