Geodesic
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 45 (2011) no. 2, pp. 75-100

Voir la notice de l'article provenant de la source Numdam

In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain solutions for small and moderate sized instances, and the best heuristics obtained optimum or near optimum solutions for all tested instances. The semidefinite relaxation gives a lower bound C W and each heuristic produces a cut S with a ratio c S w S , where either cS is at most a factor of C or wS is at least a factor of W. We solved the semidefinite relaxation using a semi-infinite cut generation with a commercial linear programming package adapted to the sparsest cut problem. We showed that the proposed strategy leads to a better performance compared to the use of a known semidefinite programming solver.

DOI : 10.1051/ro/2011104
Classification : 90C22, 90C57, 68Q87
Keywords: semidefinite programming, sparsest cut, combinatorics 
@article{RO_2011__45_2_75_0,
     author = {Meira, Luis A. A. and Miyazawa, Fl\'avio K.},
     title = {Semidefinite {Programming} {Based} {Algorithms} for the {Sparsest} {Cut} {Problem}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {75--100},
     publisher = {EDP-Sciences},
     volume = {45},
     number = {2},
     year = {2011},
     doi = {10.1051/ro/2011104},
     mrnumber = {2855947},
     zbl = {1270.90091},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2011104/}
}
TY  - JOUR
AU  - Meira, Luis A. A.
AU  - Miyazawa, Flávio K.
TI  - Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2011
SP  - 75
EP  - 100
VL  - 45
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2011104/
DO  - 10.1051/ro/2011104
LA  - en
ID  - RO_2011__45_2_75_0
ER  - 
%0 Journal Article
%A Meira, Luis A. A.
%A Miyazawa, Flávio K.
%T Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2011
%P 75-100
%V 45
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2011104/
%R 10.1051/ro/2011104
%G en
%F RO_2011__45_2_75_0
Meira, Luis A. A.; Miyazawa, Flávio K. Semidefinite Programming Based Algorithms for the Sparsest Cut Problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 45 (2011) no. 2, pp. 75-100. doi: 10.1051/ro/2011104

Cité par Sources :