The maximum edge weight clique problem: Formulations and solution approaches

Seyedmohammadhossein Hosseinian, Dalila B.M.M. Fontes, Sergiy Butenko, Marco Buongiorno Nardelli, Marco Fornari, Stefano Curtarolo

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

11 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages217-237
Number of pages21
DOIs
StatePublished - 2017

Publication series

NameSpringer Optimization and Its Applications
Volume130
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

Fingerprint

Dive into the research topics of 'The maximum edge weight clique problem: Formulations and solution approaches'. Together they form a unique fingerprint.

Cite this