Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a
Michael Armbruster Boeken
Meer dan een miljoen boeken binnen handbereik!
Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a