Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Advisors: David B. Shmoys Committee members: Carla P. Gomes; Jon Kleinberg.
Özet:
Three combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises in exam-scheduling, and the third lies on the intersection of the k-median and k-center clustering problems.
