Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- 31 December 1990
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 17 (5) , 437-445
- https://doi.org/10.1016/0305-0548(90)90048-c
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Using tabu search techniques for graph coloringComputing, 1987
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- Determining the number of internal stability of a graphInternational Journal of Computer Mathematics, 1982
- Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoileDiscrete Mathematics, 1980
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973