EPCOT: An efficient procedure for coloring optimally with Tabu Search
DOI10.1016/0898-1221(93)90279-5zbMATH Open0798.68128OpenAlexW2053765750MaRDI QIDQ1802494FDOQ1802494
Authors: Dominique De Werra, Nicolas Dubois 
Publication date: 31 October 1994
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(93)90279-5
Recommendations
- Tabu search with simple ejection chains for coloring graphs
- A tabu search heuristic for the equitable coloring problem
- A tabu search approach for the sum coloring problem
- scientific article; zbMATH DE number 597813
- Algoritmo de búsqueda tabú para una variante del problema de coloración
- Using tabu search techniques for graph coloring
- Informed reactive tabu search for graph coloring
- scientific article; zbMATH DE number 1488073
Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Title not available (Why is that?)
- New methods to color the vertices of a graph
- Using tabu search techniques for graph coloring
- The tabu search metaheuristic: How we used it
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Chromatic Scheduling and the Chromatic Number Problem
- Title not available (Why is that?)
- Algorithms for the maximum satisfiability problem
- Tabu search techniques. A tutorial and an application to neural networks
- Title not available (Why is that?)
Cited In (14)
- On the use of some known methods for \(T\)-colorings of graphs
- A common Tabu search algorithm for the global optimization of engineering problems
- Using tabu search techniques for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- A tabu search algorithm for computing an operational timetable
- Tabu search with simple ejection chains for coloring graphs
- Variants of simulated annealing for the examination timetabling problem
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- A combined global and local search method to deal with constrained optimization for continuous tabu search
- Metaheuristics: A bibliography
- On the greatest number of 2 and 3 colorings of a (v, e)-graph
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Informed reactive tabu search for graph coloring
- Coloration de graphes : fondements et applications
Uses Software
This page was built for publication: EPCOT: An efficient procedure for coloring optimally with Tabu Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802494)
