Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a
Michael Armbruster Ordre des livres
Acheter 10 livres pour 10 € ici !
Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a