The maximum cut problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

The maximum cut problem

Résumé

This chapter contains sections titled: Introduction; Complexity and polynomial cases; Applications; The cut polytope; Semi-definite programming (SDP) and the maximum cut problem; The cut cone and applications; Approximation methods; Related problems; Conclusion; Bibliography
Fichier non déposé

Dates et versions

hal-01314806 , version 1 (12-05-2016)

Identifiants

Citer

Walid Ben-Ameur, Ali Ridha Mahjoub, José Neto. The maximum cut problem. Paradigms of combinatorial optimization : problems and new approaches, volume 2, Iste; Wiley, pp.131 - 172, 2010, 978-1-84821-148-3. ⟨10.1002/9781118600207.ch6⟩. ⟨hal-01314806⟩
176 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More