Evaluating balancing on social networks through the efficient solution of correlation clustering problems
type: Item
instance of: scholarly article
title: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
zbMATH Open document ID: 1386.90161
author: Mario Levorato
author: Y. Frota
author: Rosa Figueiredo
author: Lúcia M. A. Drummond
published in: EURO Journal on Computational Optimization
publication date: 2018-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6825011
zbMATH Keywords: correlation clustering
zbMATH Keywords: social network
zbMATH Keywords: structural balance
zbMATH Keywords: ILS
zbMATH Keywords: VND
describes a project that uses: PERL
describes a project that uses: UCI-ml
describes a project that uses: SNAP
describes a project that uses: TTTPLOTS
describes a project that uses: Pajek
MaRDI profile type: Publication
full work available at URL: s13675-017-0082-6
OpenAlex ID: W2585973110
cites work: Structural Balance: A Dynamic Perspective
cites work: TTT plots: a perl program to create time-to-target plots
cites work: Aggregating inconsistent information
cites work: Parallel Metaheuristics
cites work: Correlation clustering
cites work: Greedy randomized adaptive search procedures
cites work: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
cites work: Clustering with qualitative information
cites work: Q2934029
cites work: Parallel Strategies for Meta-Heuristics
cites work: Correlation clustering in general weighted graphs
cites work: Q2770544
cites work: Pre‐transitive balance mechanisms for signed networks*
cites work: The maximum balanced subgraph of a signed graph: applications and solution approaches
cites work: Handbook of metaheuristics
cites work: Correlation clustering with a fixed number of clusters
cites work: Extracting pure network submatrices in linear programs using signed graphs.
cites work: Separator-based data reduction for signed graph balancing
cites work: Towards the determination of the optimal \(p\)-cyclic SSOR
cites work: Cliques and clustering: A combinatorial approach
cites work: Variable neighborhood search
cites work: Community detection by modularity maximization using GRASP with path relinking
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Q5501301
DOI: 10.1007/S13675-017-0082-6
description: scientific article; zbMATH DE number 6825011