5 papers · 1 filter
Scheduling of Star Observations under Uncertain Conditions: A Comparison of Models and Solvers
Thomas Rahab Lacroix, Pierre Lemaire, Nadia Brauner
We consider a scheduling problem for star observations using a telescope. Identical nights are available to observe stars that have been identified as of interest by astronomers. E…
Scheduling Ground-Based Telescope Observations with Uncertain Nights
Thomas Rahab Lacroix, Pierre Lemaire, Anne-Marie Lagrange +2
The observation of celestial objects is a fundamental activity in astronomy. Ground-based and space telescopes are used to gather electromagnetic radiation from space, allowing ast…
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…