Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

解决最大团问题的蚁群优化算法的研究与应用.kdh

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．