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

• Type: Journal
• Year: 2002
• Where: CORR
• Authors: Neal E. Young
• Keywords: Algorithms, CORR 2002, Education, Parallel Algorithm, Sequential Algorithm