Epcot: An efficient procedure for coloring optimally with Tabu Search

Computers and Mathematics with Applications

Volumn 25, Issue 10-11, 1993, Pages 35-45

  Dubois, N ^a   de Werra, D ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249001591     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(93)90279-5     Document Type: Article

References (13)

1. Using Tabu Search techniques for graph coloring
2. Heuristics for graph coloring
3. Tabu Search
4. Algorithms for the maximum satisfiability problem
5. Tabu Search techniques: A tutorial and an application to neural networks
6. The Tabu Search metaheuristic: How we used it
7. New methods to color the vertices of a graph
8. Chromatic scheduling and the chromatic number problem
9. A generalized implicit enumeration algorithm for graph coloring
10. TABARIS: An exact algorithm based on Tabu Search for finding a maximum independent set in a graph
11. STABULUS: A technique for finding stable sets in large graphs with Tabu Search
12. A generalized implicit enumeration algorithm for graph coloring