A proof of the optimality of the MIN paging algorithm using linear programming duality.
Ariel CohenWalter A. BurkhardPublished in: Oper. Res. Lett. (1995)
Keyphrases
- linear programming
- dynamic programming
- optimal solution
- detection algorithm
- computational complexity
- linear program
- np hard
- times faster
- cost function
- computational cost
- objective function
- network flow
- convex hull
- clustering method
- optimization algorithm
- expectation maximization
- worst case
- k means
- similarity measure
- energy function
- significant improvement
- search space
- iterative algorithms
- provably correct