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

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

Autoři

Michael Armbruster

Parametry

Matematika

Více o knize

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 vydání: 2008

Jakmile se objeví, pošleme e-mail.