An Old Linear Programming Algorithm Runs in Polynomial Time
Boris YamnitskyLeonid A. LevinPublished in: FOCS (1982)
Keyphrases
- linear programming
- dynamic programming
- computational complexity
- worst case
- experimental evaluation
- learning algorithm
- optimization algorithm
- np hard
- strongly polynomial
- theoretical analysis
- computational cost
- k means
- cost function
- primal dual
- optimal solution
- objective function
- significant improvement
- quadratic programming
- improved algorithm
- detection algorithm
- particle filter
- approximation algorithms
- recognition algorithm
- preprocessing
- simulated annealing
- high accuracy
- network flow
- polynomial time approximation
- genetic algorithm