An Exact Algorithm for Blockmodeling of Two-Mode Network Data (Q2857671): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58863600 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing blockmodels: how and why / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inducing a blockmodel structure of two-mode binary data using seriation procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Branch and Bound Algorithm for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Signed Two-Mode Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization strategies for two-mode partitioning / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/0022250x.2011.597278 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052607635 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
scientific article

    Statements

    An Exact Algorithm for Blockmodeling of Two-Mode Network Data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 November 2013
    0 references
    branch-and-bound
    0 references
    exact algorithms
    0 references
    generalized blockmodeling
    0 references
    social networks
    0 references
    two-mode networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references