Sciweavers

Share
RIVF
2008

On the bounded integer programming

8 years 3 months ago
On the bounded integer programming
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
Thân Quang Khoát
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where RIVF
Authors Thân Quang Khoát
Comments (0)
books