Some experiments with simulated annealing for coloring graphs

DOI10.1016/S0377-2217(87)80148-0zbMath0626.90067OpenAlexW2069558672MaRDI QIDQ581241

Dominique de Werra, M. Chams, Alain Hertz

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(87)80148-0

zbMATH Keywords

heuristics scheduling simulated annealing graph coloring thermodynamical simulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items

Local optima topology for the \(k\)-coloring problem, On the use of some known methods for \(T\)-colorings of graphs, A review on algorithms for maximum clique problems, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Simple decentralized graph coloring, Tabu search techniques. A tutorial and an application to neural networks, Variants of simulated annealing for the examination timetabling problem, Genetic and hybrid algorithms for graph coloring, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Hybrid pattern search and simulated annealing for fuzzy production planning problems, A robust simulated annealing based examination timetabling system., Heuristics for a project management problem with incompatibility and assignment costs, Quantum annealing of the graph coloring problem, A variable neighborhood search for graph coloring., Simulated annealing: A tool for operational research, Methods for the one-dimensional space allocation problem, A cooperative search method for the \(k\)-coloring problem, A graph coloring heuristic using partial solutions and a reactive tabu scheme, COSINE: A new graph coloring algorithm, CHECKCOL: improved local search for graph coloring, Coloring graphs by iterated local search traversing feasible and infeasible solutions, An adaptive memory algorithm for the \(k\)-coloring problem, An improved ant colony optimisation heuristic for graph colouring, Hybrid evolutionary algorithm for the b-chromatic number, A wide-ranging computational comparison of high-performance graph colouring algorithms, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Coloring large graphs based on independent set extraction, A survey of local search methods for graph coloring, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, On the chromatic number of graphs, Improving the extraction and expansion method for large graph coloring, Using tabu search techniques for graph coloring, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, STABULUS: A technique for finding stable sets in large graphs with tabu search, An SA/TS mixture algorithm for the scheduling tardiness problem, An incremental search heuristic for coloring vertices of a graph, General local search methods, The life span method -- a new variant of local search, Combinatorial optimization in system configuration design, A search space ``cartography for guiding graph coloring heuristics, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, An information-based neural approach to generic constraint satisfaction., AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING

Cites Work