Showing math.OCShow all
3 papers · 1 filter
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…
math.OC2024
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…
math.OC2024
A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses
Paul Revenant, Hadrien Cambazard, Nicolas Catusse
In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the orde…