A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A proof of the optimality of the MIN paging algorithm using linear programming duality |
scientific article; zbMATH DE number 937086
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of the optimality of the MIN paging algorithm using linear programming duality |
scientific article; zbMATH DE number 937086 |
Statements
A proof of the optimality of the MIN paging algorithm using linear programming duality (English)
0 references
20 October 1996
0 references
analysis of algorithms
0 references
paging
0 references
duality
0 references
assignment problem
0 references
