Faces: A Free Flight Autonomous and Coordinated Embarked Solver, Proceedings of the Second Air Traffic Management R&D Seminar ATM-2000, 1998. ,
URL : https://hal.archives-ouvertes.fr/hal-00937980
FaCiLe: A Functional Constraint Library, Colloquium on Implementation of Constraint and LOgic Programming Systems CICLOPS'01 (Workshop of CP'01), 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00938018
MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Principles and Practice of Constraint Programming, pp.61-75, 1996. ,
DOI : 10.1007/3-540-61551-2_66
The Maximum Clique Problem, Handbook of Combinatorial Optimization, 1999. ,
DOI : 10.1007/978-1-4757-3023-4_1
New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979. ,
DOI : 10.1145/359094.359101
Chromatic Scheduling and the Chromatic Number Problem, Management Science, vol.19, issue.4-part-1, pp.451-463, 1972. ,
DOI : 10.1287/mnsc.19.4.456
Constraint Propagation in Graph Coloring, Journal of Heuristics, vol.1, issue.8, pp.83-108, 2002. ,
An algorithm for the chromatic number of a graph, The Computer Journal, vol.14, issue.1, pp.38-39, 1971. ,
DOI : 10.1093/comjnl/14.1.38
Exact Coloring of Real-Life Graphs is Easy, Design Automation Conference DAC97, 1997. ,
Iterated Greedy Graph Coloring and the Difficulty Landscape, 1992. ,
Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, chapter 3, pp.77-92, 1998. ,
DOI : 10.1007/978-1-4615-5775-3_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4848
Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, vol.22, issue.3, 1994. ,
DOI : 10.1007/BF02125407
Sectorless-1 Operational Concept Document 0.1, 2002. ,
Die Tabu-Methoden zur Graphenf??rbung, Computing, vol.21, issue.4, pp.345-351, 1987. ,
DOI : 10.1007/BF02239976
Efficient coloring of a large spectrum of graphs, Proceedings of the 35th annual conference on Design automation conference , DAC '98, pp.427-432, 1998. ,
DOI : 10.1145/277044.277165
A graph coloring algorithm for large scheduling problems, Journal of Research of the National Bureau of Standards, vol.84, issue.6, pp.489-503, 1979. ,
DOI : 10.6028/jres.084.024
Optimisation du réseau des routes aériennes en Europe, 1998. ,
TOSCA-II -WP3: Assessment of the TMA to TMA Hand-over Concept, 1998. ,
A Methodology for the Design of a Route Network, Proceedings of the Third Air Traffic Management R & D Seminar ATM-2000, 2000. ,
Chromatic Number Approximation Using Simulated Annealing, In ACM Mountain Regional Meeting Proceedings, 1986. ,
A correction to Brelaz's modification of Brown's coloring algorithm, Communications of the ACM, vol.26, issue.8, pp.595-597, 1983. ,
DOI : 10.1145/358161.358171
Local Search and Backtracking versus Non-systematic Backtracking, Papers from the AAAI 2001 Fall Symposium on Using Uncertainty within Computation, pp.109-115, 2001. ,
The Br??laz Heuristic and Optimal Static Orderings, Research Report, vol.13, 1999. ,
DOI : 10.1007/978-3-540-48085-3_29
Where the Exceptionally Hard Problems Are, 1995. ,
Network Resources for Coloring a Graph A Logic Language for Combinatorial Optimization, Annals of Operations Research, vol.21, pp.247-274, 1990. ,