La régularisation dans les problèmes combinatoires et son application au problème des tournées de livraison
Lagrangean decomposition for integer programming : theory and applications
Large neighborhood improvements for solving car sequencing problems
The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
Large neighborhood improvements for solving car sequencing problems
The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
L'Espace Vectoriel Pseudo-Booléen Généralisé
Linear programming and the worst-case analysis of greedy algorithms on cubic graphs.