The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches Chapter

abstract

• 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.

authors

• Butenko, Sergiy

author list (cited authors)

• Hosseinian, S., Fontes, D., Butenko, S., Nardelli, M. B., Fornari, M., & Curtarolo, S.

citation count

• 10

complete list of authors

• Hosseinian, Seyedmohammadhossein||Fontes, Dalila BMM||Butenko, Sergiy||Nardelli, Marco Buongiorno||Fornari, Marco||Curtarolo, Stefano

Book Title

• Optimization Methods and Applications

publication date

• January 2017

publisher

• Springer Nature  Publisher

published in

• Springer Optimization and Its Applications  Journal

keywords

• 49 Mathematical Sciences
• 4901 Applied Mathematics

Digital Object Identifier (DOI)

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

International Standard Book Number (ISBN) 13

• 9783319686394

start page

• 217

end page

• 237

volume

• 130

URL

• http://dx.doi.org/10.1007/978-3-319-68640-0_10