From graph orientation to the unweighted maximum cut - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

From graph orientation to the unweighted maximum cut

Résumé

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.
Fichier principal
Vignette du fichier
from_graph_orientation_to_the_unweighted_maximum cut_problem_v2.pdf (362.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

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⟩
246 Consultations
379 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More