Continuous cubic formulations for cluster detection problems in networks
type: Item
instance of: scholarly article
title: Continuous cubic formulations for cluster detection problems in networks
zbMATH Open document ID: 1506.90210
author: Vladimir Stozhkov
author: Austin Buchanan
author: Sergiy Butenko
author: Vladimir Boginski
published in: Mathematical Programming. Series A. Series B
publication date: 2022-11-14T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7616310
zbMATH Keywords: clique relaxations
zbMATH Keywords: maximum \(s\)-defective clique problem
zbMATH Keywords: maximum \(s\)-plex problem
zbMATH Keywords: Motzkin-Straus formulation
zbMATH Keywords: Turán's theorem
zbMATH Keywords: cubic optimization
zbMATH Keywords: fractional \(b\)-matching
describes a project that uses: Gurobi
describes a project that uses: BARON
describes a project that uses: QPLIB
describes a project that uses: DIMACS
describes a project that uses: QUALEX
MaRDI profile type: Publication
full work available at URL: s10107-020-01572-4
OpenAlex ID: W3092908795
cites work: NP-hardness of deciding convexity of quartic polynomials and related problems
cites work: Turan's Graph Theorem
cites work: Proofs from THE BOOK
cites work: Constructing test functions for global optimization using continuous formulations of graph problems
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
cites work: Evolution towards the maximum clique
cites work: On standard quadratic optimization problems
cites work: Q3145799
cites work: On copositive programming and standard quadratic optimization problems
cites work: Solving Quadratic Programming by Cutting Planes
cites work: A new trust region technique for the maximum weight clique problem
cites work: Approximation of the stability number of a graph via copositive programming
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Handbook of test problems in local and global optimization
cites work: QPLIB: a library of quadratic programming instances
cites work: Q4845365
cites work: Q5687252
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: Solving the problem of packing equal and unequal circles in a circular container
cites work: Maximum weight relaxed cliques and Russian doll search revisited
cites work: A General Regularized Continuous Formulation for the Maximum Clique Problem
cites work: Q5687246
cites work: A new branch-and-bound algorithm for standard quadratic programming problems
cites work: Efficient algorithms for large scale global optimization: Lennard-Jones clusters
cites work: Combinatorial algorithms for the maximum \(k\)-plex problem
cites work: The Co-2-plex Polytope and Integral Systems
cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
cites work: A global optimization approach for solving the maximum clique problem
cites work: On clique relaxation models in network analysis
cites work: BARON: A general purpose global optimization software package
cites work: A graph‐theoretic generalization of the clique concept
cites work: A polyhedral study of the generalized vertex packing problem
cites work: New analytical lower bounds on the clique number of a graph
cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
cites work: Q3137900
cites work: Spectral bounds for the clique and independence numbers of graphs
cites work: Frequency-driven tabu search for the maximum \(s\)-plex problem
DOI: 10.1007/S10107-020-01572-4
description: scientific article; zbMATH DE number 7616310