The author considers a problem that was detailed in publications inthe mid-1970s. He gives an explicit new integer programming formulationand solves the model with data from a library lending database.

This short application-centered paper exploits the trick that many0-1 integer programming problems can be solved by merely searching amatrix for maximum or minimum values. In particular, a spreadsheetprogram can be used.