BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Mathematical Software Année : 2017

BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems

Résumé

This paper presents BiqCrunch, an exact solver for binary quadratic optimization problems. BiqCrunch is a branch-and-bound method that uses an original, efficient semidefinite-optimization-based bounding procedure. It has been successfully tested on a variety of well-known combinatorial optimization problems, such as Max-Cut, Max-k-Cluster, and Max-Independent-Set. The code is publicly available online; a web interface and many conversion tools are also provided.
Fichier principal
Vignette du fichier
biqCrunch.pdf (410.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01486513 , version 1 (09-03-2017)

Identifiants

Citer

Nathan Krislock, Jérôme Malick, Frédéric Roupin. BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems. ACM Transactions on Mathematical Software, 2017, 43 (4), pp.Article No. 32. ⟨10.1145/3005345⟩. ⟨hal-01486513⟩
424 Consultations
1061 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More