Max-AO - MaRDI portal

Cited in

(28)

A new graph parameter related to bounded rank positive semidefinite matrix completions
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
Quartic formulation of standard quadratic optimization problems
Semidefinite representations for finite varieties
A new table of permutation codes
An SDP-based approach for computing the stability number of a graph
On a continuous approach for the maximum weighted clique problem
On a polynomial fractional formulation for independence number of a graph
Permutation codes with specified packing radius
On extracting maximum stable sets in perfect graphs using Lovász's theta function
The generalized independent set problem: polyhedral analysis and solution approaches
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
CirCut
QUALEX
EXTRACOL
G23FM
FASoft
MaxCliqueDyn
Approximation of rank function and its application to the nearest low-rank correlation matrix
An effective local search for the maximum clique problem
Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
A global exact penalty for rank-constrained optimization problem and applications
A new trust region technique for the maximum weight clique problem
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
On the copositive representation of binary and continuous nonconvex quadratic programs
A review on algorithms for maximum clique problems

This page was built for software: Max-AO