A continuous based heuristic for the maximum clique problem
Conference
·
OSTI ID:36365
We develop a deterministic heuristic based on a continuous quadratic nonconvex formulation of the maximum clique problem. The developed heuristic avoids the need for the calibration of parameters while maintaining computational competitiveness to greedy randomized search procedures which require such calibration. Furthermore it demonstrates the potential for using continuous approaches to model discrete problems. Experimental results on test problems.
- OSTI ID:
- 36365
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A quadratic 0-1 optimization algorithm for the maximum clique and stable set problems
Finding Maximum Cliques on the D-Wave Quantum Annealer
Heuristic-biased stochastic sampling
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35856
Finding Maximum Cliques on the D-Wave Quantum Annealer
Journal Article
·
Thu May 03 00:00:00 EDT 2018
· Journal of Signal Processing Systems
·
OSTI ID:1438358
Heuristic-biased stochastic sampling
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:430667