Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems

Journal of Heuristics

Volumn 4, Issue 2, 1998, Pages 107-122

  Balas, Egon ^a   Niehaus, William ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GENERAL DYNAMICS   (United States)

Author keywords

Genetic algorithms; Maximum clique; Optimized crossover

Indexed keywords

GENETIC ALGORITHMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

BIPARTITE MATCHING; MAXIMUM CARDINALITY PROBLEMS; MAXIMUM WEIGHT CLIQUE PROBLEMS;

HEURISTIC METHODS;

EID: 0032119639     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009646528813     Document Type: Article

References (16)

1. Aggarwal, C.C., J.B. Orlin, and R.P. Tai. (1997). "An Optimized Crossover for Maximum Independent Set," Operations Research 45, 226-234.
2. Balas, E. and W. Niehaus. (1996). "Finding Large Cliques in Arbitrary Graphs by Bipartite Matching," In D.S. Johnson and M. A. Trick (eds.), Clique, Coloring and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 29-53.
3. Balas, E. and W. Niehaus. (1995). "A Max-Flow Based Procedure for Finding Heavy Cliques in Vertex-Weighted Graphs," MSRR No. 612, GSIA, Carnegie-Mellon University.
4. Balas, E. and J. Xue. (1996). "Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring," Algorithms 15, 397-412.
5. Battiti, R. and M. Protasi. (1995). "Reactive Local Search for the Maximum Clique Problem," International Computer Science Institute, Berkeley, CA, TR-95-052.
6. Beasley, J. and P. Chu. (1995). "A Genetic Algorithm for the Set Partitioning Problem," The Management School, Imperial College, Technical Report.
7. Brockington, M. and J.C. Culberson. (1996). "Camouflaging Independent Sets in Quasi-Random Graphs," In D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 75-89.
8. Davis, L. (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
9. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading MA: Addison Wesley.
10. Hasselberg, J., P.M. Pardalos, and G. Vairaktarakis. (1993). "Test Case Generators and Computational Results for the Maximum Clique Problem," Journal of Global Optimization 3, 463-482.
11. Johnson, D.S. and M.A. Trick (eds.). (1996). Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS.
12. Laarias, J.C. and P.W. Shor. (1992). "Keller's Cube-Tiling Conjecture is False in High Dimensions," Bulletin of the AMS 27, 279-283.
13. Mannino, C. and A. Sassano. (1996). "Edge Projection and the Maximum Cardinality Stable Set Problem," In D.S. John and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, 205-221.
14. Reeves, C. (1993). Modern Heuristic Techniques for Combinatorial Problems. New York: John Wiley and Sons, Inc.
15. Sanchis, L. (1993). "Test Case Construction for Vertex Cover Problem," Paper presented at the Second DIMACS Challenge, Rutgers University.
16. Soriano, P. and M. Gendreau. (1993). "Solving the Maximum Clique Problem Using a Tabu Search Approach," Annals of Operations Research 41, 385-403.