Show simple item record

dc.contributor.authorCheung, Sin Shuen
dc.date.accessioned2016-04-04T18:06:05Z
dc.date.issued2016-02-01
dc.identifier.otherbibid: 9597214
dc.identifier.urihttps://hdl.handle.net/1813/43698
dc.description.abstractWe study a few online and offline facility location and network design problems, including an offline facility location model with submodular opening costs, an online prize-collecting facility location model, an offline singledemand capacitated facility location model and an online prize-collecting Steiner tree problem. In this thesis, we present algorithms for these problems and their approximation ratio or competitive ratio analysis.
dc.language.isoen_US
dc.subjectApproximation Algorithms
dc.subjectNetwork Design
dc.subjectFacility Location
dc.titleOnline And Offline Facility Location And Network Design
dc.typedissertation or thesis
dc.description.embargo2021-02-01
thesis.degree.disciplineOperations Research
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Operations Research
dc.contributor.chairWilliamson,David P
dc.contributor.committeeMemberRenegar,James
dc.contributor.committeeMemberShmoys,David B


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics