References

[1]

Nicolas Barnier. Application de la programmation par contraintes à des problèmes de gestion du trafic aérien. PhD thesis, Institut National Polytechnique de Toulouse, December 2002. www.recherche.enac.fr/opti/papers/thesis/.

[2]

Nicolas Barnier and Pascal Brisset. FaCiLe: a Functional Constraint Library. ALP Newsletter, 14(2), May 2001.

[3]

Noelle Bleuzen Guernalec and Alain Colmerauer. Narrowing a 2n-block of sorting in O(nlogn). In Principles and Practice of Constraint Programming. Springer-Verlag, 1997.

[4]

William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Chris S. Mellish, editor, Fourteenth International Joint Conference on Artificial Intelligence IJCAI'95, volume 1, pages 607--615, Montréal, Québec, Canada, August 1995. Morgan Kaufmann.

[5]

J. Hopcroft and R. Karp. An n^5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal of Computing, 2(4):225--231, 1973.

[6]

Serge Le Huitouze. A new data structure for implementing extensions to Prolog. In P. Deransart and J. Mauszynski, editors, PLILP'90, LNCS 456, pages 136--150. Springer-Verlag, 1990.

[7]

Xavier Leroy. The Objective Caml System: User's and reference manual (http://caml.inria.fr), 2000.

[8]

Laurent Michel and Pascal Van Hentenryck. Localizer: A modelling language for local search. In Proceedings of the Third Conference on Principles and Practice of Constraint Programming, 1997.

[9]

Jean-Charles Régin. Generalized arc consistency for global cardinality constraint. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1996.