Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts

DOI10.1007/s11590-018-1273-7zbMath1466.90117OpenAlexW2807456963MaRDI QIDQ1634803

Esmaeel Moradi, Yajun Lu, Balabhaskar Balasundaram

Publication date: 18 December 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1273-7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Parsimonious formulations for low-diameter clusters ⋮ Graph signatures: identification and optimization ⋮ On the maximum small-world subgraph problem

Uses Software

• Gurobi
• DIMACS

Cites Work

• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems

This page was built for publication: Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts