Skip to content
2000
Volume 11, Issue 3
  • ISSN: 2352-0965
  • E-ISSN: 2352-0973

Abstract

Background: This work addresses the maximum edge weight clique problem (MEWC), an important generalization of the well-known maximum clique problem. Methods: The MEWC problem can be used to model applications in many fields including broadband network design, computer vision, pattern recognition, and robotics. We propose a random key genetic algorithm to find good quality solutions for this problem. Computational experiments are reported for a set of benchmark problem instances derived from the DIMACS maximum clique instances. Results: The results obtained show that our algorithm is both effective and efficient, as for most of the problem instances tested, we were able to match the best-known solutions with very small computational time requirements.

Loading

Article metrics loading...

/content/journals/raeeng/10.2174/2352096511666180214105643
2018-09-01
2025-07-08
Loading full text...

Full text loading...

/content/journals/raeeng/10.2174/2352096511666180214105643
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test