An Improved Algorithm for Discrete l sub 1 Linear Approximation.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
By modifying the simplex method of linear programming, the authors are able to present an algorithm for l sub 1 approximation which appears to be superior computationally to any other known algorithm for this problem. Author
- Operations Research