| N. Barnier and P. Brisset. Graph Coloring for Air Traffic Flow Management, Proc. of CPAIOR'02, Le Croisic, France, pp. 133--147, March 2002. |
....method and several other local search techniques considering also the embedding of the local search into more complex schemes like Iterated Local Search or Tabu Search. 1 Introduction The Graph Colouring Problem (GCP) plays a central role in graph theory, has direct applications in real life [4, 5, 29], and is related to many other problems such as timetabling [28, 14, 34] and frequency assignment [21] A colouring (assignment) of an undirected graph 49453 4 , where is the set of vertices and the set of edges, is a mapping # ( that ....
N. Barnier and P. Brisset. Graph coloring for air traffic flow management. In CPAIOR'02: Fourth Internation Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pages 133--147, Le Croisic, France, March 2002.
No context found.
N. Barnier and P. Brisset. Graph Coloring for Air Traffic Flow Management, Proc. of CPAIOR'02, Le Croisic, France, pp. 133--147, March 2002.
No context found.
N. Barnier and P. Brisset. Graph Coloring for Air Traffic Flow Management, Proc. of CPAIOR'02, Le Croisic, France, pp. 133--147, March 2002.
No context found.
Barnier N. and P. Brisset, 2002, Graph Coloring for Air Traffic Flow Management, Proceedings CPAIOR'02, pp. 1-15.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC