Linear programming (LP) (also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Emmanuel J. CandÃ¨s, Terence Tao
- IEEE Transactions on Information Theory
- 2005

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/splâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Jon Feldman, Martin J. Wainwright, David R. Karger
- IEEE Transactions on Information Theory
- 2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based onâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linearâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Daniela Pucci de Farias, Benjamin Van Roy
- Operations Research
- 2003

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution ofâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Jon Feldman
- 2003

Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes backâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Aharon Ben-Tal, Arkadi Nemirovski
- Math. Program.
- 2000

Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly perturbed. Weâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Aharon Ben-Tal, Arkadi Nemirovski
- Oper. Res. Lett.
- 1999

We treat in this paper Linear Programming (LP) problems with uncertain data. The focus is on uncertainty associated with hardâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Narendra Karmarkar
- STOC
- 1984

We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is <italic>O</italicâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Nimrod Megiddo
- J. ACM
- 1984

It is demonstrated that the linear programming problem in d variables and n constraints can be solved in O(n) time when d isâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Nimrod Megiddo
- 23rd Annual Symposium on Foundations of Computerâ€¦
- 1982

Linear-time for Linear Programming in R2 and R3 are presented. The methods used are applicable for some other problems. Forâ€¦Â (More)

Is this relevant?