Regularized standard polynomial programming formulations for the maximum clique problem

DOI10.1007/S10589-025-00674-ZMaRDI QIDQ6878840zbMATH OpenFDO

Authors Mykyta Makovenko, Sergiy Butenko, Miltiades P. Pardalos

Publication date 5 January 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-025-00674-Z

zbMATH Keywords

global optimizationmaximum clique problemMotzkin-Straus formulationcontinuous approaches to discrete optimizationstandard polynomial programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Polynomial optimization (90C23)

Cites work

• scientific article; zbMATH DE number 429516 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• scientific article; zbMATH DE number 956845 (Why is no real title available?)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• A general regularized continuous formulation for the maximum clique problem
• A global optimization approach for solving the maximum clique problem
• A new branch-and-bound algorithm for standard quadratic programming problems
• A new trust region technique for the maximum weight clique problem
• Annealed replication: A new heuristic for the maximum clique problem
• Approximation of the stability number of a graph via copositive programming
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• Continuous Characterizations of the Maximum Clique Problem
• Continuous cubic formulations for cluster detection problems in networks
• Evolution towards the maximum clique
• Fast cluster detection in networks by first order optimization
• Maxima for Graphs and a New Proof of a Theorem of Turán
• NP-hardness of deciding convexity of quartic polynomials and related problems
• On copositive programming and standard quadratic optimization problems
• On standard quadratic optimization problems
• On standard quadratic programs with exact and inexact doubly nonnegative relaxations
• Solving Quadratic Programming by Cutting Planes
• Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization

Cited in

(1)

• Preface: global optimization algorithms and applications

This page was built for publication: Regularized standard polynomial programming formulations for the maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878840)