Some experiments with simulated annealing for coloring graphs
From MaRDI portal
DOI10.1016/S0377-2217(87)80148-0zbMATH Open0626.90067OpenAlexW2069558672MaRDI QIDQ581241FDOQ581241
Authors: M. Chams, Dominique De Werra, 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
Recommendations
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Optimization by simulated annealing
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Cooling Schedules for Optimal Annealing
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- An introduction to timetabling
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Grouping of parts and components in flexible manufacturing systems
- Title not available (Why is that?)
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Cited In (52)
- Simulated annealing and graph colouring
- An information-based neural approach to generic constraint satisfaction.
- An adaptive memory algorithm for the \(k\)-coloring problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- On the use of some known methods for \(T\)-colorings of graphs
- A variable neighborhood search for graph coloring.
- An extraction and expansion approach for graph coloring
- Heuristics for a project management problem with incompatibility and assignment costs
- Improving the extraction and expansion method for large graph coloring
- The life span method -- a new variant of local search
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A search space ``cartography for guiding graph coloring heuristics
- Genetic and hybrid algorithms for graph coloring
- Simulated annealing and its problems to color graphs
- Title not available (Why is that?)
- Using tabu search techniques for graph coloring
- A robust simulated annealing based examination timetabling system.
- General local search methods
- Hybrid pattern search and simulated annealing for fuzzy production planning problems
- A survey of local search methods for graph coloring
- A memetic algorithm for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Combinatorial optimization in system configuration design
- Title not available (Why is that?)
- Methods for the one-dimensional space allocation problem
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- COSINE: A new graph coloring algorithm
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Simple decentralized graph coloring
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Simulated annealing: A tool for operational research
- Variants of simulated annealing for the examination timetabling problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- On the chromatic number of graphs
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A cooperative search method for the \(k\)-coloring problem
- Tabu search techniques. A tutorial and an application to neural networks
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An improved ant colony optimisation heuristic for graph colouring
- Metaheuristics: A bibliography
- Coloring large graphs based on independent set extraction
- CHECKCOL: improved local search for graph coloring
- A review on algorithms for maximum clique problems
- Local optima topology for the \(k\)-coloring problem
- Informed reactive tabu search for graph coloring
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- An incremental search heuristic for coloring vertices of a graph
- An SA/TS mixture algorithm for the scheduling tardiness problem
- Hybrid evolutionary algorithm for the b-chromatic number
This page was built for publication: Some experiments with simulated annealing for coloring graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581241)
