IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-68640-0_10.html
   My bibliography  Save this book chapter

The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches

In: Optimization Methods and Applications

Author

Listed:
  • Seyedmohammadhossein Hosseinian

    (Texas A&M University)

  • Dalila B. M. M. Fontes

    (Faculdade de Economia da Universidade do Porto, and LIAAD/INESC TEC, Rua Dr. Roberto Frias)

  • Sergiy Butenko

    (Texas A&M University)

  • Marco Buongiorno Nardelli

    (University of North Texas)

  • Marco Fornari

    (Central Michigan University)

  • Stefano Curtarolo

    (Duke University)

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.

Suggested Citation

  • Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko & Marco Buongiorno Nardelli & Marco Fornari & Stefano Curtarolo, 2017. "The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches," Springer Optimization and Its Applications, in: Sergiy Butenko & Panos M. Pardalos & Volodymyr Shylo (ed.), Optimization Methods and Applications, pages 217-237, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-68640-0_10
    DOI: 10.1007/978-3-319-68640-0_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    2. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.
    3. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2018. "A nonconvex quadratic optimization approach to the maximum edge weight clique problem," Journal of Global Optimization, Springer, vol. 72(2), pages 219-240, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-319-68640-0_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.