53 citations · 70 across the 11 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…