53 citations · 70 across the 11 of their papers we have counts for
13 papers
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…
Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
Guillaume Claus, Hadrien Cambazard, Hugo Apeloig +1
A well known technique to reduce the search space in integer programming is known as variable fixing or reduced cost strengthening. The reduced costs given by an optimal dual solut…
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…
Tree search algorithms for the Sequential Ordering Problem
Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard +1
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algor…
A global constraint for the capacitated single-item lot-sizing problem
Grigori German, Hadrien Cambazard, Jean-Philippe Gayon +1
The goal of this paper is to set a constraint programming framework to solve lot-sizing problems. More specifically, we consider a single-item lot-sizing problem with time-varying…
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…
Bin Packing with Linear Usage Costs
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan +1
Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised.…
A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan +4
We present an application focused on the design of resilient long-reach passive optical networks. We specifically consider dual-parented networks whereby each customer must be conn…