On robust clusters of minimum cardinality in networks

Chitra Balasubramaniam () and Sergiy Butenko ()
Additional contact information
Chitra Balasubramaniam: Texas A&M University
Sergiy Butenko: Texas A&M University

Annals of Operations Research, 2017, vol. 249, issue 1, No 3, 17-37

Abstract: Abstract This paper studies two clique relaxation models, k-blocks and k-robust 2-clubs, used to describe structurally cohesive clusters with good robustness and reachability properties. The minimization version of the two problems are shown to be hard to approximate for $$k \ge 3$$ k ≥ 3 and $$k \ge 4$$ k ≥ 4 , respectively. Integer programming formulations are proposed and a polyhedral study is presented. The results of sample numerical experiments on several graph instances are also reported.

Keywords: Clique relaxations; Connectivity; k-Block; k-Robust s-club; Structural cohesion (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-015-1992-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:249:y:2017:i:1:d:10.1007_s10479-015-1992-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-1992-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().