IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v232y2014i3p489-498.html
   My bibliography  Save this article

An analytical comparison of the LP relaxations of integer models for the k-club problem

Author

Listed:
  • Almeida, Maria Teresa
  • Carvalho, Filipa D.

Abstract

Given an undirected graph G=(V,E), a k-club is a subset of nodes that induces a subgraph with diameter at most k. The k-club problem is to find a maximum cardinality k-club. In this study, we use a linear programming relaxation standpoint to compare integer formulations for the k-club problem. The comparisons involve formulations known from the literature and new formulations, built in different variable spaces. For the case k=3, we propose two enhanced compact formulations. From the LP relaxation standpoint these formulations dominate all other compact formulations in the literature and are equivalent to a formulation with a non-polynomial number of constraints. Also for k=3, we compare the relative strength of LP relaxations for all formulations examined in the study (new and known from the literature). Based on insights obtained from the comparative study, we devise a strengthened version of a recursive compact formulation in the literature for the k-club problem (k>1) and show how to modify one of the new formulations for the case k=3 in order to accommodate additional constraints recently proposed in the literature.

Suggested Citation

  • Almeida, Maria Teresa & Carvalho, Filipa D., 2014. "An analytical comparison of the LP relaxations of integer models for the k-club problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 489-498.
    • Handle: RePEc:eee:ejores:v:232:y:2014:i:3:p:489-498
    DOI: 10.1016/j.ejor.2013.08.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713006504
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.08.004?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. Gouveia, Luis & Vo[ss], Stefan, 1995. "A classification of formulations for the (time-dependent) traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 69-82, May.
    2. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    3. Carvalho, Filipa D. & Almeida, M. Teresa, 2011. "Upper bounds and heuristics for the 2-club problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 489-494, May.
    4. Blazewicz, Jacek & Formanowicz, Piotr & Kasprzak, Marta, 2005. "Selected combinatorial problems of computational biology," European Journal of Operational Research, Elsevier, vol. 161(3), pages 585-597, March.
    5. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    6. Butenko, S. & Wilhelm, W.E., 2006. "Clique-detection models in computational biochemistry and genomics," European Journal of Operational Research, Elsevier, vol. 173(1), pages 1-17, August.
    7. Balabhaskar Balasundaram & Sergiy Butenko & Svyatoslav Trukhanov, 2005. "Novel Approaches for Analyzing Biological Networks," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 23-39, August.
    8. Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
    9. Bourjolly, Jean-Marie & Laporte, Gilbert & Pesant, Gilles, 2002. "An exact algorithm for the maximum k-club problem in an undirected graph," European Journal of Operational Research, Elsevier, vol. 138(1), pages 21-28, April.
    10. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    11. Alidaee, Bahram & Glover, Fred & Kochenberger, Gary & Wang, Haibo, 2007. "Solving the maximum edge weight clique problem via unconstrained quadratic programming," European Journal of Operational Research, Elsevier, vol. 181(2), pages 592-597, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    2. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    3. Komusiewicz, Christian & Nichterlein, André & Niedermeier, Rolf & Picker, Marten, 2019. "Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments," European Journal of Operational Research, Elsevier, vol. 275(3), pages 846-864.
    4. Zhou, Yi & Lin, Weibo & Hao, Jin-Kao & Xiao, Mingyu & Jin, Yan, 2022. "An effective branch-and-bound algorithm for the maximum s-bundle problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 27-39.
    5. Yajun Lu & Hosseinali Salemi & Balabhaskar Balasundaram & Austin Buchanan, 2022. "On Fault-Tolerant Low-Diameter Clusters in Graphs," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3181-3199, November.

    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. Carvalho, Filipa D. & Almeida, M. Teresa, 2011. "Upper bounds and heuristics for the 2-club problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 489-494, May.
    2. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    3. Veremyev, Alexander & Boginski, Vladimir & Pasiliao, Eduardo L. & Prokopyev, Oleg A., 2022. "On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs," European Journal of Operational Research, Elsevier, vol. 297(1), pages 86-101.
    4. Komusiewicz, Christian & Nichterlein, André & Niedermeier, Rolf & Picker, Marten, 2019. "Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments," European Journal of Operational Research, Elsevier, vol. 275(3), pages 846-864.
    5. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    6. Yezerska, Oleksandra & Mahdavi Pajouh, Foad & Butenko, Sergiy, 2017. "On biconnected and fragile subgraphs of low diameter," European Journal of Operational Research, Elsevier, vol. 263(2), pages 390-400.
    7. Shahram Shahinpour & Sergiy Butenko, 2013. "Algorithms for the maximum k-club problem in graphs," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 520-554, October.
    8. Alexander Veremyev & Vladimir Boginski & Eduardo Pasiliao, 2015. "Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra," Journal of Global Optimization, Springer, vol. 61(1), pages 109-138, January.
    9. Buchanan, Austin & Sung, Je Sang & Boginski, Vladimir & Butenko, Sergiy, 2014. "On connected dominating sets of restricted diameter," European Journal of Operational Research, Elsevier, vol. 236(2), pages 410-418.
    10. Yajun Lu & Hosseinali Salemi & Balabhaskar Balasundaram & Austin Buchanan, 2022. "On Fault-Tolerant Low-Diameter Clusters in Graphs," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3181-3199, November.
    11. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    12. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    13. Maciej Rysz & Foad Mahdavi Pajouh & Pavlo Krokhmal & Eduardo L. Pasiliao, 2018. "Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights," Annals of Operations Research, Springer, vol. 262(1), pages 89-108, March.
    14. Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
    15. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
    16. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.
    17. Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo, 2017. "Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques," Working Papers 1722, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Foad Mahdavi Pajouh & Esmaeel Moradi & Balabhaskar Balasundaram, 2017. "Detecting large risk-averse 2-clubs in graphs with random edge failures," Annals of Operations Research, Springer, vol. 249(1), pages 55-73, February.
    19. Veremyev, Alexander & Prokopyev, Oleg A. & Boginski, Vladimir & Pasiliao, Eduardo L., 2014. "Finding maximum subgraphs with relatively large vertex connectivity," European Journal of Operational Research, Elsevier, vol. 239(2), pages 349-362.
    20. Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko, 2013. "Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations," Computational Optimization and Applications, Springer, vol. 56(1), pages 113-130, September.

    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:eee:ejores:v:232:y:2014:i:3:p:489-498. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.