Some experiments with simulated annealing for coloring graphs
From MaRDI portal
Publication:581241
DOI10.1016/S0377-2217(87)80148-0zbMath0626.90067MaRDI QIDQ581241
Dominique de Werra, Alain Hertz, M. Chams
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
05C15: Coloring of graphs and hypergraphs
Related Items
On the chromatic number of graphs, Using tabu search techniques 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 general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Tabu search techniques. A tutorial and an application to neural networks, COSINE: A new graph coloring algorithm, STABULUS: A technique for finding stable sets in large graphs with tabu search, An SA/TS mixture algorithm for the scheduling tardiness problem, General local search methods, The life span method -- a new variant of local search, Local optima topology for the \(k\)-coloring problem, A robust simulated annealing based examination timetabling system., A variable neighborhood search for graph coloring., An information-based neural approach to generic constraint satisfaction., 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, On the use of some known methods for \(T\)-colorings of graphs, A graph coloring heuristic using partial solutions and a reactive tabu scheme, 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, Embedding a novel objective function in a two-phased local search for robust vertex coloring, A survey of local search methods for graph coloring
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An introduction to timetabling
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Grouping of parts and components in flexible manufacturing systems
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Cooling Schedules for Optimal Annealing
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- Equation of State Calculations by Fast Computing Machines
