Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,772,525 papers from all fields of science

Search

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

Highly Cited

2012

Highly Cited

2012

In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent…

Highly Cited

2004

Highly Cited

2004

We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case…

Highly Cited

2001

Highly Cited

2001

We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms…

Highly Cited

2000

Highly Cited

2000

The problem of distributing gas through a network of pipelines is formulated as a cost minimization subject to nonlinear flow…

Highly Cited

1999

Highly Cited

1999

In this paper, we proposed simplex crossover (SPX), a multi-parent recombination operator for real-coded genetic algorithms. SPX…

Highly Cited

1998

Highly Cited

1998

The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional…

Highly Cited

1992

Highly Cited

1992

We present several new steepest-edge simplex algorithms for solving linear programming problems, including variants of both the…

Highly Cited

1977

Highly Cited

1977

It is shown that suitable recurrences may be used in order to implement in practice the steepest-edge simplex linear programming…

Highly Cited

1977

Highly Cited

1977

One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and…

Highly Cited

1970

Highly Cited

1970

Abstract : By constructing long 'increasing' paths on appropriate convex polytopes, It is shown that the simplex algorithm for…