Showing 2025 · math.OCShow all
2 papers · 2 filters
math.OC2025
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 -…
math.OC2025
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…