Thumbnail - Request a copy

The maximum cut problem

Ben-Ameur, Walid; Mahjoub, Ali Ridha; Neto, José (2013), The maximum cut problem, in Paschos, Vangelis Th., Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2, Wiley-ISTE, p. 131-172. 10.1002/9781118600207.ch6

Type
Chapitre d'ouvrage
Date
2013
Book title
Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2
Book author
Paschos, Vangelis Th.
Publisher
Wiley-ISTE
ISBN
9781118600207
Number of pages
700
Pages
131-172
Publication identifier
Metadata
Show full item record
Author(s)
Ben-Ameur, Walid cc
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Neto, José cc
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Abstract (EN)
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.
Subjects / Keywords
Maximum cut problem; Complexity/polynomial cases; Spin glass models; Maximum cut, and SDP; Approximation methods