Keywords
Tabu searchMaxima and minimaSimulated annealingGraph coloringGraphGuided Local SearchHill climbingComputer scienceMathematical optimizationMathematicsAlgorithmGreedy coloringCombinatoricsGraph powerLine graph
Affiliated Institutions
Related Publications
Ant system: optimization by a colony of cooperating agents
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach...
Ants can solve constraint satisfaction problems
We describe a novel incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artifici...
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
A new global optimization algorithm for functions of continuous variables is presented, derived from the “Simulated Annealing” algorithm recently introduced in combinatorial opt...
Ants can colour graphs
AbstractIn the last few years researchers have shown how insect colonies can be seen as a natural model of collective problem solving. The analogy between the behaviour of ants ...
Publication Info
- Year
- 1987
- Type
- article
- Volume
- 39
- Issue
- 4
- Pages
- 345-351
- Citations
- 652
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
652
OpenAlex
Cite This
Alain Hertz,
D. de Werra
(1987).
Using tabu search techniques for graph coloring.
Computing
, 39
(4)
, 345-351.
https://doi.org/10.1007/bf02239976
Identifiers
- DOI
- 10.1007/bf02239976