On solving the maximum clique problem |
| |
| Authors: | Antonina Kuznetsova and Alexander Strekalovsky |
| |
| Affiliation: | (1) Institute of System Dynamics and Control Theory SB of RAS, Lermontov Str., 134, Irkutsk-33, 664033, Russia |
| |
| Abstract: | The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Search approaches. |
| |
| Keywords: | d.c. maximization global optimality conditions local search linearized problem global search algorithm |
| 本文献已被 SpringerLink 等数据库收录！ |
