A. Renaud, J. Valenzuela, and A. E. Smith, Daily Generation Management at Electricité de France IEEE TAC V-38-7 A Seeded Memetic Algorithm for Large Unit Commitment Problems, Journal of Heuristics, vol.8, pp.173-195, 1993.

B. Rottembourg, Optimisation Combinatoire : Séparation, Relaxation et Approximation, 2003.

R. Bellman, Dynamic Programming, 1957.

A. M. Geoffrion, Lagrangian relaxation and its uses in integer programming, 1974.

G. Cohen, Optimisation des grands systèmes, 2003.

T. Benoist, Relaxations et Décompositions Combinatoires, Thèse de doctorat, 2004.

F. Foccacci, A. Lodi, and M. Milano, Cost-Based Domain Filtering, Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, pp.189-203, 1999.
DOI : 10.1007/978-3-540-48085-3_14

T. Benoist, F. Laburthe, and B. Rottembourg, Lagrange Relaxation and Constraint Programming Collaboratives schemes for Traveling Tournament Problems, Proceding CP- AIRO'01, 2001.

R. Barták, Constraint Programming : In Pursuit of the Holy Grail, Proceedings of Workshop of Doctoral Students'99, 1999.

W. Harvey and M. Ginsberg, Limited Discrepancy Search, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pp.607-613, 1995.

.. Coût-réduit-d-'une-seule-unité, Notations supplémentaires basées sur les chemins, p.11