On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems

Siavosh Benabbas. On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems. PhD thesis, University of Toronto, Canada, 2012. [doi]

No reviews for this publication, yet.