From graph orientation to the unweighted maximum cut

In this paper, starting from graph orientation problems, we introduce some new mixed integer linear programming formulations for the unweighted maximum cut problem. Then a new semidefinite relaxation is proposed and shown to be tighter than the Goemans and Williamson's semidefinite relaxation. Preliminary computational results are also reported.

Mots clés

Graph theory Maximum cut Graph orientation Complexity NP-complete Approximation algorithm Mixed integer programming Semidefinite programming

Domaines

Combinatoire [math.CO] Informatique [cs] Mathématique discrète [cs.DM]

Fichier principal

from_graph_orientation_to_the_unweighted_maximum cut_problem_v2.pdf (362.87 Ko)

Origine	Fichiers produits par l'(les) auteur(s)

antoine glorieux : Connectez-vous pour contacter le contributeur

https://hal.science/hal-01497887

Soumis le : mercredi 29 mars 2017-14:22:18

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

Archivage à long terme le : vendredi 30 juin 2017-15:19:04

Dates et versions

hal-01497887 , version 1 (29-03-2017)

Identifiants

HAL Id : hal-01497887 , version 1
DOI : 10.1007/978-3-319-42634-1_30

Citer

Walid Ben-Ameur, Antoine Glorieux, José Neto. From graph orientation to the unweighted maximum cut. COCOON 2016 : 22nd International Conference on Computing and Combinatorics, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007/978-3-319-42634-1_30⟩. ⟨hal-01497887⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS TELECOM-SUDPARIS TDS-MACS UNIV-PARIS-SACLAY INSTITUT-MINES-TELECOM

253 Consultations

399 Téléchargements