Keywords
Tabu searchGuided Local SearchHeuristicSet (abstract data type)GraphComputer scienceMathematical optimizationHill climbingGraph coloringMathematicsIncremental heuristic searchAlgorithmSearch algorithmBeam searchTheoretical computer science
Affiliated Institutions
Related Publications
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...
A multi-objective genetic local search algorithm and its application to flowshop scheduling
We propose a hybrid algorithm for finding a set of nondominated solutions of a multi objective optimization problem. In the proposed algorithm, a local search procedure is appli...
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 ...
Multi-objective genetic local search algorithm
Proposes a hybrid algorithm for finding a set of non-dominated solutions of a multi-objective optimization problem. In the proposed algorithm, a local search procedure is applie...
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...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 42
- Issue
- 1
- Pages
- 35-44
- Citations
- 104
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
104
OpenAlex
Cite This
C. Friden,
Alain Hertz,
D. de Werra
(1989).
STABULUS: A technique for finding stable sets in large graphs with tabu search.
Computing
, 42
(1)
, 35-44.
https://doi.org/10.1007/bf02243141
Identifiers
- DOI
- 10.1007/bf02243141