2 papers
cs.DS2019
Online Multistage Subset Maximization Problems
Evripidis Bampis, Bruno Escoffier, Kevin Schewior +1
Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as \emph{subset maximization problems}: One is given a ground set $N=\{1,\do…
cs.DS2019
Multistage Knapsack
Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
Many systems have to be maintained while the underlying constraints, costs and/or profits change over time. Although the state of a system may evolve during time, a non-negligible…