Optimization problems for the maximum \(k\)-plex

DOI10.1007/s10559-022-00488-5OpenAlexW4306690291MaRDI QIDQ2103796

Yanyan Li

Publication date: 9 December 2022

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-022-00488-5

zbMATH Keywords

maximum cliquequadratic optimization problemBoolean linear programming problemLagrangian dual boundmaximum \(k\)-plexsuperfluous constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20)

Uses Software

• Octave
• GLPK

Cites Work

• Combinatorial algorithms for the maximum \(k\)-plex problem
• Functionally redundant constraints for Boolean quadratic-type optimization problems
• Nondifferentiable optimization and polynomial problems
• On the maximum quasi-clique problem
• New quadratic models for the maximum weighted cut problem
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• A graph‐theoretic generalization of the clique concept

This page was built for publication: Optimization problems for the maximum \(k\)-plex