On solving the maximum clique problem

Authors:
Antonina Kuznetsova;Alexander Strekalovsky
Affiliations:
Institute of System Dynamics and Control Theory SB of RAS, Lermontov Str., 134, Irkutsk-33, 664033, Russia E-mail: kuznet@icc.ru;Institute of System Dynamics and Control Theory SB of RAS, Lermontov Str., 134, Irkutsk-33, 664033, Russia E-mail: strekal@icc.ru
Venue:
Journal of Global Optimization
Year:
2001

Citing 6
Cited 3

Relaxation labeling networks for the maximum clique problem

Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Feasible and infeasible maxima in a quadratic program for maximum clique

Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolution towards the Maximum Clique

Journal of Global Optimization
Testing the Re- strategy for a Reverse Convex Problem

Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Branch-and-bound approaches to standard quadratic optimization problems

Journal of Global Optimization
On a Local and Global Search Involved in Nonconvex Optimization Problems

Automation and Remote Control
Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

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.