Olivier Briant

Learn More
When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable(More)
In some industries, a certain part can be needed in a very large number of different configurations. This is the case, e.g., for the electrical wirings in European car factories. A given configuration can be replaced by a more complete, therefore more expensive, one. The diversity management problem consists of choosing an optimal set of some given number k(More)
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It is designed for either numerical or categorical data. Like the Ward agglomerative hierarchical clustering algorithm and the k-means partitioning algorithm, it is based on the(More)
A disruption management problem for commercial airlines, has been presented by Amadeus for the ROADEF 2008/2009 Challenge, an international competition organized by the French Operational Research and Decision Support Society (ROADEF). This paper presents this industrial large scale optimization problem and underlines its difficulties compared to previously(More)
The ground routing problem consists in scheduling the movements of aircraft on the ground between runways and parking positions while respecting operational and safety requirements in the most efficient way. We present a Mixed Integer Programming (MIP) formulation for routing aircraft along a predetermined path. This formulation is generalized to allow(More)
  • 1