Continuous characterizations of the maximum clique problem

Mathematics of Operations Research

Volumn 22, Issue 3, 1997, Pages 754-768

  Gibbons, Luana E ^a   Hearn, Donald W ^a   Pardalos, Panos M ^a   Ramana, Motakuri V ^a  

^a University of Florida   (United States)

Author keywords

Local optimality; Maximum clique; Quadratic programming

Indexed keywords

EID: 0000966995     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.3.754     Document Type: Article

References (7)

1. Gibbons, L. E. (1994). Algorithms for the maximum clique problem, Ph.D. Thesis, Department of ISE, University of Florida, Gainesville.
2. Murty, K. G., S. Kabadi (1987). Some NP-complete problems in quadratic and nonlinear programming, Math. Programming 39 117-129.
3. Lovász, L. (1994). Stable sets and polynomials, Discrete Math. 124 137-153.
4. Luenberger, D. G. (1984). Linear and Nonlinear Programming, Addison-Wesley, Menlo Park, California.
5. Motzkin, T. S., E. G. Strauss (1965). Maxima for graphs and a new proof of a theorem of Turan, Canad. J. Math. 17 533-540.
6. Pardalos, P. M., G. Schnitger (1988). Checking local optimality in constrained quadratic programming is NP-hard, Oper. Res. Lett. 7 33-35.
7. Pelillo, M., A. Jagota (1995). A characterization for maximal cliques, Manuscript.