An Exact Algorithm for Blockmodeling of Two-Mode Network Data
From MaRDI portal
Publication:2857671
DOI10.1080/0022250X.2011.597278zbMath1279.91137OpenAlexW2052607635WikidataQ58863600 ScholiaQ58863600MaRDI QIDQ2857671
Andrej Mrvar, Michael J. Brusco, Douglas Steinley, Patrick Doreian
Publication date: 5 November 2013
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0022250x.2011.597278
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Multiobjective blockmodeling for social network analysis ⋮ An exact algorithm for the two-mode \(KL\)-means partitioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Optimization strategies for two-mode partitioning
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- Computational study of large-scale \(p\)-median problems
- Constructing blockmodels: how and why
- Cluster analysis and mathematical programming
- Variable neighborhood search
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- Partitioning Signed Two-Mode Networks
- Tabu Search—Part I
- Tabu Search—Part II
- A Branch and Bound Clustering Algorithm
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
This page was built for publication: An Exact Algorithm for Blockmodeling of Two-Mode Network Data