A variant of Karmarkar's linear programming algorithm for problems in standard form.
David M. GayPublished in: Math. Program. (1988)
Keyphrases
- linear programming
- np hard problems
- benchmark problems
- experimental evaluation
- optimal or near optimal
- np hard
- dynamic programming
- k means
- high accuracy
- test problems
- optimization algorithm
- quadratic programming
- computational cost
- computational complexity
- worst case
- mixed integer programming
- search space
- detection algorithm
- convex hull
- convergence rate
- knapsack problem
- constraint propagation
- objective function
- neural network
- mixed integer
- similarity measure
- linear program
- segmentation algorithm
- clustering algorithm
- significant improvement
- optimal solution