Stronger linear programming relaxations of max-cut (0)

by D Avis, J Umemoto
Venue:Mathematical Programming