Extended and discretized formulations for the maximum clique problem

Computers and Operations Research

Volumn 37, Issue 7, 2010, Pages 1348-1358

  Martins, Pedro ^a  

^a POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

Author keywords

Discretized formulations; Extended formulations; Maximum clique problem

Indexed keywords

BRANCH AND BOUNDS; CLIQUE NUMBER; COMPUTATIONAL RESULTS; EXTENDED FORMULATIONS; INDEPENDENT SET; LINEAR PROGRAMMING RELAXATION; LOWER AND UPPER BOUNDS; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; MAXIMUM INDEPENDENT SETS; NEW MODEL; SPARSE GRAPHS; UPPER BOUND;

COMBINATORIAL OPTIMIZATION; LINEARIZATION; PROBLEM SOLVING; SEMICONDUCTOR COUNTERS; SET THEORY; SWITCHING CIRCUITS;

GRAPH THEORY;

EID: 70649099039     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.10.010     Document Type: Article

References (35)

1. Bahadur K.C., Akutsu T., Tomita E., Seki T., and Fujiyama A. Protein matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm. Genome Informatics 13 (2002) 143-152
2. Balasundaram B, Butenko S, Hicks IV, Sachdeva S. Clique relaxations in social network analysis: the maximum k-plex problem. Manuscript 〈http://ie.tamu.edu/people/faculty/butenko/papers/kplex060127.pdf〉; 2006.
3. Battiti R., and Protasi M. Reactive local search for the maximum clique problem. Algorithmica 29 4 (2001) 610-637
4. Bellare M, Goldreich O, Sudan M. Free bits, PCPs and non-approximability-toward tight results. In: Proceedings of the 36th annual IEEE symposium on foundations of computer science. New York: IEEE Computer Society; 1995. p. 422-31.
5. Berman P, Pelc A. Distributed fault diagnosis for multiprocessor systems. In: Proceedings of the 20th annual international symposium on fault-tolerant computing, Newcastle, UK, 1990. p. 340-6.
6. Boccaletti S., Latora V., Moreno Y., Chavez M., and Hwang D.-U. Complex networks: structure and dynamics. Physics Reports 424 (2006) 175-308
7. Bomze I.M., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. In: Du D.Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization, suppl. vol. A (1999), Kluwer, Dordrecht 1-74
8. Butenko S., and Wilhelm W.E. Clique-detection models in computational biochemistry and genomics. European Journal of Operational Research 173 (2006) 1-17
9. Caprara A., Carr R., Istrail S., Lancia G., and Walenz B. 1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap. Journal of Computational Biology 11 (2004) 27-52
10. Cavique L, Luz CJ. A heuristic for the stability number of a graph based on convex quadratic programming and tabu search. Journal of Mathematical Sciences 2009:161(6):944-55.
11. Cook D.J., and Holder L.B. Graph-based data mining. IEEE Intelligent Systems 15 2 (2000) 32-41
12. Crescenzi P., Fiorini C., and Silvestri R. A note on the approximation of the MAX CLIQUE problem. Information Processing Letters 40 (1991) 1-5
13. de Klerk E., and Pasechnik D.V. Approximation of the stability number of a graph via copositive programming. SIAM Journal on Optimization 12 4 (2002) 875-892
14. Della Croce F., and Tadei R. A multi-KP modeling for the maximum-clique problem. European Journal of Operational Research 73 (1994) 555-561
15. Fahle T. Simple and fast: improving a branch-and-bound algorithm for maximum clique. In: Lecture notes in computer science, vol. 2461. Berlin: Springer; 2002. p. 485-98.
16. Gagneur J., Krause R., Bouwmeester T., and Casari G. Modular decomposition of protein-protein interaction networks. Genome Biology 5 8 (2004) R57.1-R57.12
17. Gardiner E.J., Artymiuk P.J., and Willett P. Clique-detection algorithms for matching three-dimensional molecular structures. Journal of Molecular Graphics and Modelling 15 (1997) 245-253
18. Gendron B., Hertz A., and St-Louis P. A sequential elimination algorithm for computing bounds on the clique number of a graph. Discrete Optimization 5 3 (2008) 615-628
19. Grotschel M., Lovász L., and Scherijver A. Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics vol. 2 (1988), Springer, Berlin
20. Grosso A., Locatelli M., and Pullan W. Simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics 14 6 (2008) 587-612
21. Hansen P., Mladenović N., and Urošević D. Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145 (2004) 117-125
22. Hotta K., Tomita E., and Takahashi H. A view-invariant human face detection method based on maximum cliques. Transactions of IPSJ 44 SIG14 (2003) 57-70
23. Johnson DS, Trick MA, editors. Cliques, coloring and satisfiability. In: DIMACS series in Discrete mathematics and theoretical computer science, vol. 26, 1996.
24. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of computer computations (1972), Plenum Press, New York 85-103
25. Krishna P., Vaidya N., Chatterjee M., and Pradhan D. A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review (1997) 49-65
26. Luce R.D., and Perry A.D. A method of matrix analysis of group structure. Psychometrika 14 (1949) 95-116
27. Luz C.J., and Schrijver A. A convex quadratic characterization of the Lovász theta number. SIAM Journal on Discrete Mathematics 19 2 (2005) 382-387
28. Östergård P.R.J. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120 (2002) 197-207
29. Pena J., Vera J., and Zuluaga L. Computing the stability number of a graph via linear and semidefinite programming. SIAM Journal on Optimization 18 1 (2007) 87-105
30. Regin J-C. Solving the maximum clique problem with constraint programming. In: Lecture notes in computer science., vol. 2883. Berlin: Springer; 2003. p. 634-48.
31. Spirin V., and Mirny L.A. Protein complexes and functional modules in molecular networks. Proceedings of the National Academy of Science 100 21 (2003) 12123-12128
32. Strickland D.M., Barnes E., and Sokol J.S. Optimal protein structure alignment using maximum cliques. Operations Research 53 3 (2005) 389-402
33. Tomita E., and Kameda T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal on Global Optimization 37 (2007) 95-111
34. Valente A.X.C.N., and Cusick M.E. Yeast protein interactome topology provides framework for coordinated-functionality. Nucleic Acids Research 34 9 (2006) 2812-2819
35. Han J.D., Bertin N., Hao T., et al. Evidence for dynamically organized modularity in the yeast protein-protein interaction network. Nature 430 (2004) 88-93