Approximate fixed-rank closures of covering problems.

Autor: Bienstock, Daniel1 dano@columbia.edu, Zuckerberg, Mark1
Zdroj: Mathematical Programming. Jan2006, Vol. 105 Issue 1, p9-27. 19p.
Databáze: Academic Search Ultimate
Externí odkaz: