Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
type: Item
instance of: scholarly article
title: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
zbMATH Open document ID: 1414.90349
author: Esmaeel Moradi
author: B. Balasundaram
published in: Optimization Letters
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6994907
zbMATH Keywords: \(k\)-club
zbMATH Keywords: clique
zbMATH Keywords: low-diameter clusters
zbMATH Keywords: lazy cuts
describes a project that uses: Gurobi
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s11590-015-0971-7
OpenAlex ID: W2180772693
cites work: A graph‐theoretic definition of a sociometric clique†
cites work: Integer models and upper bounds for the 3‐club problem
cites work: An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
cites work: Canonical Cuts on the Unit Hypercube
cites work: Novel approaches for analyzing biological networks
cites work: Heuristics for finding \(k\)-clubs in an undirected graph
cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
cites work: Upper bounds and heuristics for the 2-club problem
cites work: On provably best construction heuristics for hard combinatorial optimization problems
cites work: On finding \(k\)-cliques in \(k\)-partite graphs
cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
cites work: On the 2-Club Polytope of Graphs
cites work: Clique Relaxation Models in Social Network Analysis
cites work: Parameterized computational complexity of finding small-diameter subgraphs
cites work: Algorithms for the maximum \(k\)-club problem in graphs
cites work: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
cites work: Node-and edge-deletion NP-complete problems
DOI: 10.1007/S11590-015-0971-7
description: scientific article; zbMATH DE number 6994907