Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a
Michael Armbruster Reihenfolge der Bücher
Gratisversand in ganz Deutschland!
Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a