53 citations · 65 across the 12 of their papers we have counts for
14 papers
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…
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…
Logistic regression to boost exoplanet detection performances
Hadrien Cambazard, Nicolas Catusse, A. Chomez +1
Direct imaging of exoplanets requires to separate the background noise from the exoplanet signals. Statistical methods have been recently proposed to avoid subtracting any signal o…
A bin packing formulation for the joint batching, routing and sequencing problem
Olivier Briant, Hadrien Cambazard, Diego Cattaruzza +3
Warehouses are the scene of complex logistic problems integrating different decision layers. This paper addresses the Joint Order Batching, Picker Routing and Sequencing Problem wi…
Innovative ideas for teaching supports: Application to Graph theory
Nicolas Catusse, Hadrien Cambazard, Nadia Brauner +2
Teaching graph theory with the most adequate tools requires time and ideas. We present how an open community of teachers shares contents and ideas on an innovative platform. The ob…
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…
Dealing with elementary paths in the Kidney Exchange Problem
Lucie Pansart, Hadrien Cambazard, Nicolas Catusse
We study an elementary path problem which appears in the pricing step of a column generation scheme solving the kidney exchange problem. The latter aims at finding exchanges of don…
An integer programming formulation using convex polygons for the convex partition problem
Hadrien Cambazard, Nicolas Catusse
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a c…
Exact algorithms for the order picking problem
Lucie Pansart, Nicolas Catusse, Hadrien Cambazard
Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in t…
Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane
Hadrien Cambazard, Nicolas Catusse
Given a set of points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is re…
Bidirected minimum Manhattan network problem
Nicolas Catusse, Victor Chepoi, Karim Nouioua +1
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that t…
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
Nicolas Catusse, Victor Chepoi, Karim Nouioua +1
Let B be a centrally symmetric convex polygon of R^2 and || p - q || be the distance between two points p,q in R^2 in the normed plane whose unit ball is B. For a set T of n points…
Embedding into the rectilinear plane in optimal O*(n^2)
Nicolas Catusse, Victor Chepoi, Yann Vaxès
We present an optimal O*(n^2) time algorithm for deciding if a metric space (X,d) on n points can be isometrically embedded into the plane endowed with the l_1-metric. It improves…