IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v30y2022i4d10.1007_s10100-021-00776-z.html
   My bibliography  Save this article

Numerical experiments with LP formulations of the maximum clique problem

Author

Listed:
  • Dóra Kardos

    (University of Szeged)

  • Patrik Patassy

    (University of Szeged)

  • Sándor Szabó

    (University of Pecs)

  • Bogdán Zaválnij

    (Alfred Renyi Institute of Mathematics)

Abstract

The maximum clique problems calls for determining the size of the largest clique in a given graph. This graph problem affords a number of zero-one linear programming formulations. In this case study we deal with some of these formulations. We consider ways for tightening the formulations. We carry out numerical experiments to see the improvements the tightened formulations provide.

Suggested Citation

  • Dóra Kardos & Patrik Patassy & Sándor Szabó & Bogdán Zaválnij, 2022. "Numerical experiments with LP formulations of the maximum clique problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1353-1367, December.
    • Handle: RePEc:spr:cejnor:v:30:y:2022:i:4:d:10.1007_s10100-021-00776-z
    DOI: 10.1007/s10100-021-00776-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-021-00776-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-021-00776-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Della Croce, Federico & Tadei, Roberto, 1994. "A multi-KP modeling for the maximum-clique problem," European Journal of Operational Research, Elsevier, vol. 73(3), pages 555-561, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Coniglio, Stefano & Furini, Fabio & San Segundo, Pablo, 2021. "A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts," European Journal of Operational Research, Elsevier, vol. 289(2), pages 435-455.

    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:cejnor:v:30:y:2022:i:4:d:10.1007_s10100-021-00776-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.