Optimization problems for the maximum \(k\)-plex
type: Item
instance of: scholarly article
title: Optimization problems for the maximum \(k\)-plex
author: Yanyan Li
published in: Cybernetics and Systems Analysis
publication date: 2022-12-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 7630519
zbMATH Keywords: maximum \(k\)-plex
zbMATH Keywords: maximum clique
zbMATH Keywords: quadratic optimization problem
zbMATH Keywords: Boolean linear programming problem
zbMATH Keywords: superfluous constraint
zbMATH Keywords: Lagrangian dual bound
describes a project that uses: Octave
describes a project that uses: GLPK
MaRDI profile type: Publication
full work available at URL: s10559-022-00488-5
OpenAlex ID: W4306690291
cites work: A graph‐theoretic generalization of the clique concept
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
cites work: Combinatorial algorithms for the maximum \(k\)-plex problem
cites work: On the maximum quasi-clique problem
cites work: Nondifferentiable optimization and polynomial problems
cites work: Functionally redundant constraints for Boolean quadratic-type optimization problems
cites work: New quadratic models for the maximum weighted cut problem
DOI: 10.1007/S10559-022-00488-5
description: scientific article; zbMATH DE number 7630519