Maximum stable set formulations and heuristics based on continuous optimization
From MaRDI portal
Publication:1396818
DOI10.1007/S10107-002-0356-4zbMath1023.90071OpenAlexW2058237467MaRDI QIDQ1396818
Renato D. C. Monteiro, Samuel Burer, Yin Zhang
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/101960
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (25)
An SDP-based approach for computing the stability number of a graph ⋮ A review on algorithms for maximum clique problems ⋮ A heuristic for the stability number of a graph based on convex quadratic programming and tabu search ⋮ On the copositive representation of binary and continuous nonconvex quadratic programs ⋮ On a continuous approach for the maximum weighted clique problem ⋮ Permutation codes with specified packing radius ⋮ Semidefinite representations for finite varieties ⋮ Penalty decomposition methods for rank minimization ⋮ Approximation of rank function and its application to the nearest low-rank correlation matrix ⋮ Handling symmetries in mixed-integer semidefinite programs ⋮ Inexact penalty decomposition methods for optimization problems with geometric constraints ⋮ A new trust region technique for the maximum weight clique problem ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ The generalized independent set problem: polyhedral analysis and solution approaches ⋮ Indirect unstructured hex-dominant mesh generation using tetrahedra recombination ⋮ On extracting maximum stable sets in perfect graphs using Lovász's theta function ⋮ An efficient method for convex constrained rank minimization problems based on DC programming ⋮ Simple ingredients leading to very efficient heuristics for the maximum clique problem ⋮ Max-AO ⋮ A new table of permutation codes ⋮ An effective local search for the maximum clique problem ⋮ Quartic formulation of standard quadratic optimization problems
Uses Software
This page was built for publication: Maximum stable set formulations and heuristics based on continuous optimization
