A proof of the optimality of the MIN paging algorithm using linear programming duality

Ariel Cohen, Walter A. Burkhard. A proof of the optimality of the MIN paging algorithm using linear programming duality. Oper. Res. Lett., 18(1):7-13, 1995. [doi]

Abstract

Abstract is missing.