Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts''
type: Item
instance of: scholarly article
title: Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts''
zbMATH Open document ID: 1466.90117
author: Yajun Lu
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: 6994908
describes a project that uses: Gurobi
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s11590-018-1273-7
OpenAlex ID: W2807456963
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
DOI: 10.1007/S11590-018-1273-7
Recommended article: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Recommended article: Erratum: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Recommended article: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Recommended article: The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
Recommended article: A note on the approximation of the MAX CLIQUE problem
Recommended article: A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
Recommended article: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
Recommended article: On the approximability of clique and related maximization problems
Recommended article: A cutting-plane approach to the edge-weighted maximal clique problem
Recommended article: An algorithm for reporting maximal \(c\)-cliques
description: scientific article; zbMATH DE number 6994908