Optimized crossover for the independent set problem

Operations Research

Volumn 45, Issue 2, 1997, Pages 226-234

  Aggarwal, Charu C ^a   Orlin, James B ^a   Tai, Ray P ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; FUNCTIONS; HEURISTIC METHODS; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

INDEPENDENT SET PROBLEM; KNOWLEDGE-BASED CROSSOVER MECHANISMS;

GENETIC ALGORITHMS;

EID: 0031097803     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.2.226     Document Type: Article

References (24)

1. AHUJA, R. K., T. L. MAGNANTI AND J. B. ORLIN. 1993. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. BACK, T. AND S. KHURI. 1994. An Evolutionary Heuristic for the Maximum Independent Set Problem. Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE Press, 531-535.
3. BALAS, E. AND W. NIEHAUS. 1996. Finding Large Cliques by Bipartite Matching. DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 26, Cliques, Coloring, and Satisfiability. D. Johnson and M. Trick (eds.).
4. BALAS, E. AND C. S. Yu. 1986. Finding the Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15, 1054-1068.
5. BEAN, J. C. 1994. Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA J. Comput. 6, 154-160.
6. BROM, C. AND J. KERBOSCH. 1973. Finding All Cliques of an Undirected Graph. Communications of the ACM, 16, 6, 575-577.
7. CARRAGHAN, R. AND P. M. PARDALOS. 1990. An Exact Algorithm for the Maximum Clique Problem. O. R. Lett. 9, 375-382.
8. DE JONG, K. A. 1975. Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph. D. Dissertation, University of Michigan, Ann Arbor, MI.
9. ESHELMAN, L. J., R. A. CARUANA AND J. D. SCHAFFER. 1989. Biases in the Crossover Landscape. Proceedings of the Third International Conference on Genetic Algorithms, June, 10-19.
10. GAREY, M. AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
11. GENDREAU, M., J. C. PICARD AND L. ZUBIETA. 1988. An Efficient Implicit Enumeration Algorithm for the Maximum Clique Program. In Lecture Notes in Economics and Mathematical Systems. A. Kurzhanski et al. (eds.), Springer-Verlag.
12. GERHARDS, L. AND W. LINDENBERG. 1979. Clique Detection for Nondirected Graphs: Two New Algorithms. Computing, 21, 295-322.
13. GIBBONS, L. E., D. W. HEARN AND P. M. PARDALOS. 1996. A Continuous Based Heuristic for the Maximum Clique Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 26, 103-124.
14. GIBBONS, L. E., P. M. PARDALOS AND D. W. HEARN. 1994. An Exact Algorithm With Accelerated Pruning for the Maximum Clique Problem. Research Report 94-1, Department of Industrial and Systems Eng. University of Florida.
15. GLOVER, F. 1989. Tabu Search - Part 1. ORSA J. Comput. 190-206.
16. GOLDBERG, D. E. 1987. Simple Genetic Algorithms and the Minimal Deceptive Problem. In Genetic Algorithms and Simulated Annealing, L. Davis (ed.), Chapter 6, 74-88, Morgan Kaufmann, Los Altos, CA.
17. GOLDBERG, D. E. 1989. Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis. Complex Systems, 3, 153-171.
18. HOLLAND, J. H. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
19. LOUKAKIS, E. AND C. TSOUROS. 1982. Determining the Number of Internal Stability of a Graph. Internal J. Comput. Math. 11, 232-248.
20. PARDALOS, P. M. AND G. P. RODGERS. 1992. A Branch and Bound Algorithm for the Maximum Clique Problem. Comput. and Opns. Res. 19, 5, 363-375.
21. PARDALOS, P. M., AND J. XUE. 1994. The Maximum Clique Problem. J. Global Optimization, 4, 301-328.
22. REEVES, C. R. (ED.). 1993. Modern Heuristic Techniques for Combinatorial Problems. John Wiley and Sons Inc.
23. RICHARDSON, J. T., M. R. PALMER, G. LIEPENS, AND M. HILLIARD. 1989. Some Guidelines for Genetic Algorithms with Penalty Functions. Proceedings of the 3rd International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA., 191-197.
24. TARJAN, R. E. AND A. E. TROJANOSWSKI. 1977. Finding a Maximum Independent Set. SIAM J. Comput. 6, 3, 537-546.