An Improved Algorithm for Discrete l sub 1 Linear Approximation.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1972
Accession Number
AD0742907

Entities

People

  • F. D. K. Roberts
  • I. Barrodale

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • British Columbia
  • Computer Programming
  • Cooperation
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Computer science
  • Mathematics