Franz Rendl, Giovanni Rinaldi, Angelika Wiegele. A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. In Matteo Fischetti, David P. Williamson, editors, Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings. Volume 4513 of Lecture Notes in Computer Science, pages 295-309, Springer, 2007. [doi]
@inproceedings{RendlRW07,
title = {A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations},
author = {Franz Rendl and Giovanni Rinaldi and Angelika Wiegele},
year = {2007},
doi = {10.1007/978-3-540-72792-7_23},
url = {http://dx.doi.org/10.1007/978-3-540-72792-7_23},
tags = {rule-based},
researchr = {https://researchr.org/publication/RendlRW07},
cites = {0},
citedby = {0},
pages = {295-309},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
editor = {Matteo Fischetti and David P. Williamson},
volume = {4513},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-72791-0},
}