Hosseini Alamdari, Soroush
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.
Kleinberg, Jon M.; Gomes, Carla P.
Attribution 4.0 International