𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

✍ Scribed by Eranda Çela; Bettina Klinz; Christophe Meyer


Publisher
Springer US
Year
2006
Tongue
English
Weight
331 KB
Volume
12
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES