The maximum edge weight clique problem: Formulations and solution approaches

Published

Book Section

© Springer International Publishing AG 2017. Given an edge-weighted graph, the maximum edge weight clique (MEWC) problem is to find a clique that maximizes the sum of edge weights within the corresponding complete subgraph. This problem generalizes the classical maximum clique problem and finds many real-world applications in molecular biology, broadband network design, pattern recognition and robotics, information retrieval, marketing, and bioinformatics among other areas. The main goal of this chapter is to provide an up-to-date review of mathematical optimization formulations and solution approaches for the MEWC problem. Information on standard benchmark instances and state-of-the-art computational results is also included.

Full Text

Duke Authors

Cited Authors

  • Hosseinian, S; Fontes, DBMM; Butenko, S; Nardelli, MB; Fornari, M; Curtarolo, S

Published Date

  • January 1, 2017

Volume / Issue

  • 130 /

Book Title

  • Springer Optimization and Its Applications

Start / End Page

  • 217 - 237

Digital Object Identifier (DOI)

  • 10.1007/978-3-319-68640-0_10

Citation Source

  • Scopus