Sciweavers

Share
CORR
2002
Springer

Sequential and Parallel Algorithms for Mixed Packing and Covering

8 years 8 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a
Neal E. Young
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Neal E. Young
Comments (0)
books