Improved genetic algorithm for maximum clique problem

DOI10.3724/SP.J.1087.2008.03072zbMATH Open1171.90513MaRDI QIDQ3399485FDOQ3399485

Authors: Donghui Wu, Liang Ma 

Publication date: 12 October 2009

Published in: Journal of Computer Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2079894
• On solving the maximum clique problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• A review on algorithms for maximum clique problems
• An algorithm for finding a maximum clique in a graph

zbMATH Keywords

optimizationgenetic algorithmMax Clique Problem (MCP)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)

Cited In (7)

• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A genetic algorithm for the maximum 2-packing set problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Solving the maximum weighted clique problem based on parallel biological computing model
• Title not available (Why is that?)
• A review on algorithms for maximum clique problems
• Title not available (Why is that?)

This page was built for publication: Improved genetic algorithm for maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399485)