A heuristic for the stability number of a graph based on convex quadratic programming and tabu search

Journal of Mathematical Sciences

Volumn 161, Issue 6, 2009, Pages 944-955

  Cavique, L ^a   Luz, C J ^a  

^a INSTITUTO POLITÉCNICO DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350325293     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1007/s10958-009-9613-x     Document Type: Article

References (22)

1. F. Alizadeh, A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs, In: ACM-SIAM Symposium on Discrete Algorithms, Vol. 2, 188-194 (1991).
2. N. Alon and N. Kahale, Approximating the independence number via the theta-function, Math. Program., 80, No. 3, 253-264 (1988).
3. S. Benson and Y. Ye, Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation, In: Applications and Algorithms of complementarity, Eds. M. Ferris and J. Pang, Kluwer Academic Publishers, (2000), pp. 1-18.
4. J. V. Burke, A. S. Lewis, and M. L. Overton, Two numerical methods for optimizing matrix stability, Linear Algebra Appl., 351-352, 117-145 (2002).
5. J. V. Burke, A. S. Lewis, and M. L. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim., 15, No. 3, 751-779 (2005).
6. S. Burer, R. D. C. Monteiro, and Y. Zhang, Maximum stable formulations and heuristics based on continuous optimization, Math Program., 94, No. 1, 137-166 (2002).
7. F. H. Clarke, Optimization and nonsmooth analysis, Classics Appl. Math., 5, SIAM, Philadelphia (1990).
8. L. Cavique, C. Rego, and I. Themido, Estruturas de vizinhança e procura local no problema da clique máxima, Investigacón Oper., 22, 1-18 (2002).
9. L. Cavique, C. Rego, and I. Themido, A scatter search algorithm for the maximum clique problem, In: Essays and Surveys in Metaheuristics, eds. C. Ribeiro and P. Hansen, Kluwer Academic Publishers (2002), pp. 227-244.
10. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers (1997).
11. F. Glover, A template for scatter search and path relinking, In: Lecture Notes in Computer Science, Eds. J.-K. Hao, E. Lutton, E. Ronald, M. Schoenaurer and D. Snyers (1997), pp. 1-5.
12. F. Glover, Scatter search and path relinking, In: New Ideas in Optimization (D. Corne, M. Dorigo, and F. Glover, eds.), McGraw-Hill International (1999).
13. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin (1988).
14. G. Gruber and F. Rendl, Computational experience with stable set relaxations, SIAM J. Optim., 13, No. 4, 1014-1028 (2003).
15. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9, 256-278 (1974).
16. K. C. Kiwiel, Methods of descent for nondifferentiable optimization, Lecture Notes in Math., 1133, Springer-Verlag, Berlin, New York (1985).
17. D. E. Knuth, The sandwich theorem, Electron. J. Combin., 1, Article 1 (1994).
18. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25, No. 2, 1-7 (1979).
19. C. J. Luz, An upper bound on the independence number of a graph computable in polynomial time, Oper. Res. Lett., 18, 139-145 (1995).
20. C. J. Luz and A. Schrijver, A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math., 19, No. 2, 382-387 (2005).
21. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall (1977).
22. E. A. Yildirim and X. Fan, On extracting maximum stable sets in perfect graphs using Lovász's theta function, Comput. Optim. Appl., 33, Nos. 2-3, 229-247 (2006).