Explore the latest books of this year!
Bookbot

Branch and cut for an SDP relaxation of large scale minimum bisection problems

Parameters

More about the book

Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems. The minimum bisection problem (MB) is a

Book purchase

Branch and cut for an SDP relaxation of large scale minimum bisection problems, Michael Armbruster

Language
Released
2008
We’ll email you as soon as we track it down.

Payment methods

No one has rated yet.Add rating