1 citations · 1 across the 4 of their papers we have counts for
4 papers
Robust single-stage selection problems with budgeted interval uncertainty
Antoine Lhomme, Nadia Brauner, Evgeny Gurevsky +2
We study single-stage decision problems in which a subset of items with minimum total cost has to be selected at once from a given set of items, subject to two costs of each item -…
On the convergence of computational methods for the online bin stretching problem
Antoine Lhomme, Nicolas Catusse, Nadia Brauner
Online bin stretching is an online packing problem where some of the best known lower and upper bounds were found through computational searches. The limiting factor in obtaining b…
Computational bounds on randomized algorithms for online bin stretching
Antoine Lhomme, Nicolas Catusse, Nadia Brauner
A frequently studied performance measure in online optimization is competitive analysis. It corresponds to the worst-case ratio, over all possible inputs of an algorithm, between t…
Online bin stretching lower bounds: Improved search of computational proofs
Antoine Lhomme, Olivier Romane, Nicolas Catusse +1
Computing lower and upper bounds on the competitive ratio of online algorithms is a challenging question: For a minimization combinatorial problem, proving a competitive ratio for…