Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time

Daniel A. Spielman Shang-Hua Teng

Published in: CoRR (2001)

Keyphrases

simplex algorithm
learning algorithm
computational complexity
linear programming
worst case
randomly generated
np complete
evolutionary algorithm
optimization problems
convergence rate
knapsack problem
computationally intensive