TY - CHAP
T1 - The maximum edge weight clique problem
T2 - Formulations and solution approaches
AU - Hosseinian, Seyedmohammadhossein
AU - Fontes, Dalila B.M.M.
AU - Butenko, Sergiy
AU - Nardelli, Marco Buongiorno
AU - Fornari, Marco
AU - Curtarolo, Stefano
N1 - Funding Information:
Acknowledgments This work was carried out, while the second author was a visiting scholar at Texas A&M University, College Station, TX, USA, and is partially supported by scholarship SFRH/BSAB/113662/2015. Partial support by DOD-ONR (N00014-13-1-0635) NSF (CMMI-1538493) grants is also gratefully acknowledged.
Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85042427406&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-68640-0_10
DO - 10.1007/978-3-319-68640-0_10
M3 - Chapter
AN - SCOPUS:85042427406
T3 - Springer Optimization and Its Applications
SP - 217
EP - 237
BT - Springer Optimization and Its Applications
PB - Springer International Publishing
ER -