| Article ID: | iaor2002901 |
| Country: | Netherlands |
| Volume: | 21 |
| Issue: | 5 |
| Start Page Number: | 211 |
| End Page Number: | 217 |
| Publication Date: | Dec 1997 |
| Journal: | Operations Research Letters |
| Authors: | Wood David R. |
This paper introduces a branch-and-bound algorithm for the maximum clique problem which applies existing clique finding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms.