A quadratic 0-1 optimization algorithm for the maximum clique and stable set problems
Conference
·
OSTI ID:35856
It is well known that several combinatorial optimization problems can be readily and nicely modeled as appropriately defined quadratic 0-1 functions to be optimized. In this paper we present an algorithm for minimizing general quadratic 0-1 functions and, indirectly, any problem (such as the maximum stable set and the maximum clique problems) which is reducible to this model. The algorithm we present uses a bounding procedure based on two simple quadratic 0-1 identities. When interpreted in the context of the maximum stable set and clique problems, this procedure can be viewed as computing packings of edges, odd cycles and odd homeomorphs of K{sub 4}. In this paper we also report on the computational experiments carried out on 44 DIMACS clique benchmark instances and 15 randomly generated clique instances with 90% density and up to 200 nodes. Ours is a general-purpose algorithm that has proved to be effective in solving the maximum stable set and clique problems via quadratic 0-1 optimization.
- OSTI ID:
- 35856
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Finding Maximum Cliques on the D-Wave Quantum Annealer
Solving hard set covering problems
The maximum clique enumeration problem: algorithms, applications, and implementations
Journal Article
·
Thu May 03 00:00:00 EDT 2018
· Journal of Signal Processing Systems
·
OSTI ID:1438358
Solving hard set covering problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36257
The maximum clique enumeration problem: algorithms, applications, and implementations
Journal Article
·
Mon Jun 25 00:00:00 EDT 2012
· BMC Bioinformatics
·
OSTI ID:1626291