SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Annals of Operations Research

Volumn 41, Issue 4, 1993, Pages 385-403

Solving the maximum clique problem using a tabu search approach

(3) Gendreau, Michel a Soriano, Patrick a Salvail, Louis a

a UNIVERSITÉ DE MONTRÉAL (Canada)

Author keywords

approximate methods; Maximum clique; probabilistic tabu; random graph generator; tabu search

Indexed keywords

EID: 21144478761 PISSN: 02545330 EISSN: 15729338 Source Type: Journal
DOI: 10.1007/BF02023002 Document Type: Article

Times cited : (88)

References (47)

1
- 0009062533
- Gordon and Breach, New York
- (1962) Economic Applications of the Theory of Graphs
- Avondo-Bodeno, G.¹

2
- 84936636865
- L. Babel, Finding maximum cliques in arbitrary and in special graphs, Report TUM-M9008, Mathematisches Institut und Institut für Informatik, Technische Universität München (1990), to appear in Computing.

3
- 0000827467
- A branch and bound algorithm for the maximum clique problem
- (1990) Zeits. Oper. Res. , vol.34 , pp. 207-217
- Babel, L.¹ Tinhofer, G.²

4
- 0026135666
- Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs
- (1991) SIAM J. Comput. , vol.20 , pp. 209-221
- Balas, E.¹ Xue, J.²

5
- 0022808049
- Finding a maximum clique in an arbitrary graph
- (1986) SIAM J. Comput. , vol.15 , pp. 1054-1068
- Balas, E.¹ Yu, C.S²

6
- 0003927335
- Dunod, Paris
- (1962) Théorie des Graphes et ses Applications
- Berge, C.¹

7
- 0004219960
- Academic Press, London
- (1985) Random Graphs
- Bollobas, B.¹

8
- 84971124259
- Cliques in random graphs
- (1976) Math. Proc. Camb. Phil. Soc. , vol.80 , pp. 419-427
- Bollobas, B.¹ Erdös, P.²

9
- 84976668743
- Finding all cliques of an undirected graph
- (1973) Communications of the ACM , vol.16 , pp. 575-577
- Bron, C.¹ Kerbosch, J.²

10
- 0025521978
- An exact algorithm for the maximum clique problem
- (1990) Oper. Res. Lett. , vol.9 , pp. 375-382
- Carraghan, R.¹ Pardalos, P.M.²

11
- 0016441710
- De l'utilisation de la notion de clique (sous-graphe complet symétrique) en matière de typologie des populations
- (1975) Revue française d'automatique et recherche opérationelle: Recherche opérationelle , vol.9 , pp. 5-18
- Degot, V.¹ Hualde, J.M.²

12
- 0003482398
- Prentice-Hall, Englewood Cliffs
- (1974) Graph Theory with Applications to Engineering and Computer Science
- Deo, N.¹

13
- 0042741212
- Pseudo-Boolean functions and stability of graphs
- (1984) Ann. Discr. Math. , vol.19 , pp. 83-98
- Ebenegger, C.¹ Hammer, P.L.² de Werra, D.³

14
- 0001931981
- Stabulus: a technique for finding stable sets in large graphs with tabu search
- (1989) Computing , vol.42 , pp. 35-44
- Friden, C.¹ Hertz, A.² de Werra, D.³

15
- 0025541550
- Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- (1990) Comput. Oper. Res. , vol.17 , pp. 437-445
- Friden, C.¹ Hertz, A.² de Werra, D.³

16
- 0003603813
- Freeman, San Francisco
- (1979) Computers and Intractibility: a Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

17
- 84936636866
- M. Gendreau, A fast greedy algorithm for the maximum clique problem, paper presented at the TIMS/ORSA Meeting, New Orleans (May 1987).

18
- 0345571073
- An efficient implicit enumeration algorithm for the maximum clique problem
- H.A., Eiselt, G., Pederzoli, Springer, Berlin
- (1988) Advances in Optimization and Control
- Gendreau, M.¹ Picard, J.-C.² Zubieta, L.³

19
- 84936636862
- M. Gendreau, L. Salvail and P. Soriano, An appraisal of greedy heuristics for the maximum clique problem, Centre de Recherche sur les Transports, Université de Montréal, forthcoming.

20
- 84936636834
- M. Gendreau, P. Soriano and L. Salvail, Simulated annealing and cliques, Centre de Recherche sur les Transports, Université de Montréal, forthcoming; paper presented at the ORSA/TIMS Meeting, New York (October 1989).

21
- 0018321324
- Clique detection for nondirected graphs: two new algorithms
- (1979) Computing , vol.21 , pp. 295-322
- Gerhards, L.¹ Lindenberg, W.²

22
- 0022865373
- Future paths for integer programming and links to artificial intelligence
- (1986) Comput. Oper. Res. , vol.13 , pp. 533-549
- Glover, F.¹

23
- 0000411214
- Tabu search. Part I
- (1989) ORSA Journal on Computing , vol.1 , pp. 190-206
- Glover, F.¹

24
- 0001724713
- Tabu search. Part II
- (1990) ORSA Journal on Computing , vol.2 , pp. 4-32
- Glover, F.¹

25
- 0022603257
- Simulated annealing without rejected moves
- (1986) IEEE Trans. Comput. Aided Des. , vol.5 CAD , pp. 221-228
- Greene, J.W.¹ Supowit, K.J.²

26
- 0003957164
- Springer, Berlin
- (1988) Geometric Algorithms and Combinatorial Optimization
- Grötschel, M.¹ Lovasz, L.² Schrijver, A.³

27
- 84936636837
- P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, RUTCOR Research Report 43–87, Rutgers University (1987).

28
- 84913373137
- Graph theory as a structural model in the social sciences
- B., Harris, Academic Press, New York
- (1970) Graph Theory and its Applications
- Harary, F.¹

29
- 0023596413
- Using tabu search techniques for graph coloring
- (1987) Computing , vol.29 , pp. 345-351
- Hertz, A.¹ de Werra, D.²

30
- 0016349356
- Approximation algorithms for combinatorial problems
- (1974) J. Comput. Syst. Sci. , vol.9 , pp. 256-278
- Johnson, D.S.¹

31
- 0023978535
- On generating all maximal independent sets
- (1988) Inf. Proc. Lett. , vol.27 , pp. 119-123
- Johnson, D.S.¹ Yannakakis, M.² Papadimitriou, C.H.³

32
- 26444479778
- Optimization by simulated annealing
- (1983) Science , vol.220 , pp. 671-680
- Kirkpatrick, S.¹ Gelatt, C.D.² Vecchi, M.P.³

33
- 0020564766
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- (1983) Comput. Math. Appl. , vol.9 , pp. 583-589
- Loukakis, E.¹

34
- 0020412373
- Determining the number of internal stability of a graph
- (1982) Int. J. Comput. Math. , vol.11 , pp. 207-220
- Loukakis, E.¹ Tsouros, C.²

35
- 84936636838
- D.W. Matula, The employee party problem, Not. A.M.S. 19(1972)A-382.

36
- 84936636839
- D.W. Matula, The largest clique in a random graph, Technical Report CS7608, Southern Methodist University (1976).

37
- 51249172831
- Expose-and-merge exploration and the chromatic number of a random graph
- (1987) Combinatorica , vol.7 , pp. 275-284
- Matula, D.W.¹

38
- 0008141737
- An algorithm for finding a maximum weighted independent set in arbitrary graph
- (1991) International Journal of Computer Mathematics , vol.38 , pp. 163-175
- Pardalos, P.M.¹ Desai, N.²

39
- 0000110396
- A global optimization approach for solving the maximum clique problem
- (1990) Int. J. Comput. Math. , vol.33 , pp. 209-216
- Pardalos, P.M.¹ Phillips, A.²

40
- 0026897860
- A branch and bound algorithm for the maximum clique problem
- (1992) Comp. Oper. Res. , vol.19 , pp. 363-375
- Pardalos, P.M.¹ Rodgers, G.P.²

41
- 0001038743
- Algorithms for the maximum independent sets
- (1986) J. Algor. , vol.7 , pp. 425-440
- Robson, J.M.¹

42
- 0040107318
- Dunod, Paris
- (1969) Algèbre Moderne et Théorie des Graphes, Vol. 1
- Roy, B.¹

43
- 84936636840
- C.E. Shannon, The zero-error capacity of a noisy channel, Symp. on Information Theory, I.R.E. Trans. 3(1956).

44
- 0001513435
- Finding a maximum independent set
- (1977) SIAM Journal on Computing , vol.6 , pp. 537-546
- Tarjan, R.E.¹ Trojanowski, A.E.²

45
- 84936636841
- J. Turner and W.H. Kautz, A survey of progress in graph theory in the Soviet Union, SIAM 12(1970).

46
- 0001262012
- Tabu search techniques: A tutorial and application to neural networks
- (1989) OR Spektrum , vol.11 , pp. 131-141
- de Werra, D.¹ Hertz, A.²

47
- 0024700013
- A new heuristic method for solving the flow shop sequencing problem
- (1989) Eur. J. Oper. Res. , vol.41 , pp. 186-193
- Widmer, M.¹ Hertz, A.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.