Abstract
dc:description.abstractThree 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.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Computer Science
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- Cornell University
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hosseini Alamdari, Soroush
- Chair dc:contributor.chair
-
- Shmoys, David B.
- Committee members dc:contributor.committeemember
-
- Kleinberg, Jon M.
- Gomes, Carla P.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Attribution 4.0 International
- Licence dc:rights.uri
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 10489417
- Dc Identifier Other
-
ProQuest Submission ID: 10798
ProQuest Publication ID: 10813646