Improved semidefinite bounding procedure for solving Max-Cut problems to optimality - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Année : 2014

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality

Résumé

We present an improved algorithm for finding exact solutions to Max-Cut and the related binary quadratic programming problem, both classic problems of combinatorial optimization. The algorithm uses a branch-(and-cut-)and-bound paradigm, using standard valid inequalities and nonstandard semidefinite bounds. More specifically, we add a quadratic regularization term to the strengthened semidefinite relaxation in order to use a quasi-Newton method to compute the bounds. The ratio of the tightness of the bounds to the time required to compute them can be controlled by two real parameters; we show how adjusting these parameters and the set of strengthening inequalities gives us a very efficient bounding procedure. Embedding our bounding procedure in a generic branch-and-bound platform, we get a competitive algorithm: extensive experiments show that our algorithm dominates the best existing method.
Fichier principal
Vignette du fichier
krislock-malick-roupin-2012.pdf (439.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00665968 , version 1 (03-02-2012)

Identifiants

Citer

Nathan Krislock, Jérôme Malick, Frédéric Roupin. Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Mathematical Programming, 2014, 143 (1-2), pp.61-86. ⟨10.1007/s10107-012-0594-z⟩. ⟨hal-00665968⟩
886 Consultations
608 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More