Bookbot

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

Parametre

Viac o knihe

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

Nákup knihy

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

Jazyk
Rok vydania
2008
Akonáhle sa objaví, pošleme e-mail.

Platobné metódy

Nikto zatiaľ neohodnotil.Ohodnotiť