Exact and Approximate Algorithms for Some Combinatorial Problems

Thumbnail
View/Open
PERMANENT LINK(S)
https://doi.org/10.7298/X4Z899NC
https://hdl.handle.net/1813/59333
Collections
Metadata
Show full item record
Author
Hosseini Alamdari, Soroush
Abstract
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.
Date Issued
2018-05-30
Subject
Operations research
Committee Chair
Shmoys, David B.
Committee Member
Kleinberg, Jon M.; Gomes, Carla P.
Degree Discipline
Computer Science
Degree Name
Ph. D., Computer Science
Degree Level
Doctor of Philosophy
Rights
Attribution 4.0 International
Rights URI
Type
dissertation or thesis
Creative CommonsAttribution 4.0 International
Except where otherwise noted, this item's license is described as Attribution 4.0 International

Statistics