Local optima topology for the \(k\)-coloring problem

DOI10.1016/0166-218X(94)90212-7zbMath0801.90116OpenAlexW1980862472MaRDI QIDQ1327233

Alain Hertz, Brigitte Jaumard, Marcus V. Poggi de Aragão

Publication date: 18 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90212-7

zbMATH Keywords

heuristicssimulated annealingtabu search\(k\)-coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Genetic algorithms and tabu search: Hybrids for optimization, Metaheuristics: A bibliography, A cooperative search method for the \(k\)-coloring problem, The \(k\)-coloring fitness landscape, Constructive generation of very hard 3-colorability instances, Variable neighborhood search: Principles and applications, A search space ``cartography for guiding graph coloring heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Path Partitions in Directed Graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu Search—Part I
• Tabu Search—Part II