(PDF) A Branch and Bound Algorithm for Max-Cut Based on

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

doi 10.1007/978-3-540-72792-7_23

Full Text

Abstract

Available in full text

Date

Unknown

Authors

Giovanni Rinaldi

Angelika Wiegele

Publisher

Springer Berlin Heidelberg