The maximum cut problem

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

Mots clés

Maximum cut problem Complexity/polynomial cases Spin glass models Maximum cut and SDP Approximation methods

Domaines

Optimisation et contrôle [math.OC]

Médiathèque Télécom SudParis & Institut Mines-Télécom Business School : Connectez-vous pour contacter le contributeur

https://hal.science/hal-01314806

Soumis le : jeudi 12 mai 2016-10:18:24

Dernière modification le : mardi 17 septembre 2024-15:52:32

Dates et versions

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

Identifiants

HAL Id : hal-01314806 , version 1
DOI : 10.1002/9781118600207.ch6

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-DAUPHINE TELECOM-SUDPARIS LAMSADE-DAUPHINE TDS-MACS PSL INSTITUT-MINES-TELECOM

188 Consultations

0 Téléchargements