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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Franz Rendl' in GoogleThis author has not been identified. Look up 'Giovanni Rinaldi' in GoogleThis author has not been identified. Look up 'Angelika Wiegele' in Google

runs on WebDSL