STABULUS: A technique for finding stable sets in large graphs with tabu search |
| |
| Authors: | C Friden A Hertz D de Werra |
| |
| Affiliation: | 1. Department of Mathematics, Swiss Federal Institute of Technology, CH-1015, Lausanne-Ecublens, Switzerland
|
| |
| Abstract: | Numerical experiments with tabu search have been carried out for constructing independent sets in large graphs. We present some variations on the independent set problem and discuss the results obtained by the tabu search technique. As for graph coloring, this method seems to be a very efficient heuristic procedure. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
