3 citations · 6 across the 9 of their papers we have counts for
4 papers · 2 filters
LP-based algorithms for multistage minimization problems
Evripidis Bampis, Bruno Escoffier, Alexander Kononov
We consider a multistage framework introduced recently where, given a time horizon t=1,2,...,T, the input is a sequence of instances of a (static) combinatorial optimization proble…
Online learning for min-max discrete problems
Evripidis Bampis, Dimitris Christou, Bruno Escoffier +1
We study various discrete nonlinear combinatorial optimization problems in an online learning framework. In the first part, we address the question of whether there are negative re…
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…
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…