I have the following question:
Assume each student can borrow at most 10 books from the library, and the library has three copies of each title in its inventory. Each student submits a list of books he wishes to borrow. You have to assign books to students, so that a maximal number of volumes is checked out.
I was wondering whether this is a Max Flow problem? If so, should it be set out like this?
Would a greedy algorithm work here? Simply, pick a student and assign whatever books are applicable to him and then move on to the next?