| Article ID: | iaor1994250 |
| Country: | Serbia |
| Volume: | 2 |
| Start Page Number: | 3 |
| End Page Number: | 11 |
| Publication Date: | Dec 1992 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Hansen Pierre, Mladenovic Nenad |
Five recent practically efficient methods for solving the maximum clique problem are briefly described and compared on randomly generated graphs.