We propose heuristics for obtaining large stable sets in G based on these new formulations and present computational results indicating the effectiveness of the ...

Oct 22, 2024 · The main focus of the paper is on the problem of finding a small-world subgraph of maximum cardinality in a given graph. We describe a mixed ...

In this paper, we show that restricting the matrix variable in the Lovasz semidefinite program to be rank-one or rank-two yields a pair of continuous, nonlinear ...

Dec 13, 2000 · We propose heuristics for obtaining large stable sets in G based on these new formulations and present computational results indicating the ...

Dec 12, 2000 · We propose heuristics for obtaining large stable sets in G based on these new formulations and present computational results indicating the ...

Maximum stable set formulations and heuristics based on continuous optimization · S. Burer, R. Monteiro, Yin Zhang · Published in Mathematical programming 1 ...

We propose heuristics for obtaining large stable sets in G based on these new formulations and present computational results indicating the effectiveness of the ...

Maximum stable set formulations and heuristics based on continuous optimization. Samuel Burer; Renato D.C. Monteiro; Yin Zhang. Pages: 137 - 166. A feasible ...

Announcing the technical report: Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization By Sam Burer, Renato Monteiro, Yin Zhang ...

We present a new exact approach to the stable set problem, which avoids the pitfalls of existing approaches based on linear and semidefinite programming.