IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v21y2022i01ns0219622021500504.html
   My bibliography  Save this article

Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers

Author

Listed:
  • Yu Du

    (University of Colorado at Denver, USA)

  • Gary Kochenberger

    (University of Colorado at Denver, USA)

  • Fred Glover

    (��University of Colorado at Boulder, USA)

  • Haibo Wang

    (��Texas A&M International University, USA)

  • Mark Lewis

    (�Missouri State University, USA)

  • Weihong Xie

    (�Guangdong University of Technology, P. R. China)

  • Takeshi Tsuyuguchi

    (��Texas A&M International University, USA)

Abstract

Finding good solutions to clique partitioning problems remains a computational challenge. With rare exceptions, finding optimal solutions for all but small instances is not practically possible. However, choosing the most appropriate modeling structure can have a huge impact on what is practical to obtain from exact solvers within a reasonable amount of run time. Commercial solvers have improved tremendously in recent years and the combination of the right solver and the right model can significantly increase our ability to compute acceptable solutions to modest-sized problems with solvers like CPLEX, GUROBI and XPRESS. In this paper, we explore and compare the use of three commercial solvers on modest sized test problems for clique partitioning. For each problem instance, a conventional linear model from the literature and a relatively new quadratic model are compared. Extensive computational experience indicates that the quadratic model outperforms the classic linear model as problem size grows.

Suggested Citation

  • Yu Du & Gary Kochenberger & Fred Glover & Haibo Wang & Mark Lewis & Weihong Xie & Takeshi Tsuyuguchi, 2022. "Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 59-81, January.
    • Handle: RePEc:wsi:ijitdm:v:21:y:2022:i:01:n:s0219622021500504
    DOI: 10.1142/S0219622021500504
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622021500504
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622021500504?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.

    Citations

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


    Cited by:

    1. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.

    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:wsi:ijitdm:v:21:y:2022:i:01:n:s0219622021500504. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.