@inproceedings{7191df74a7f44f1b81a69be1f8bd3d1f,
title = "From graph orientation to the unweighted maximum cut",
abstract = "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{\textquoteright}s semidefinite relaxation. Preliminary computational results are also reported.",
author = "Walid Ben-Ameur and Antoine Glorieux and Jos{\'e} Neto",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 22nd International Conference on Computing and Combinatorics, COCOON 2016 ; Conference date: 02-08-2016 Through 04-08-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-42634-1\_30",
language = "English",
isbn = "9783319426334",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "370--384",
editor = "Dinh, \{Thang N.\} and Thai, \{My T.\}",
booktitle = "Computing and Combinatorics - 22nd International Conference, COCOON 2016, Proceedings",
}