JavaScript is disabled for your browser. Some features of this site may not work without it.
Attention submitters: Web accessibility policy to take effect October 15, 2019
For more information, please see our web accessibility policy and web accessibility help for submitters.
For more information, please see our web accessibility policy and web accessibility help for submitters.
Online And Offline Facility Location And Network Design
Abstract
We 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.
Date Issued
2016-02-01Subject
Approximation Algorithms; Network Design; Facility Location
Committee Chair
Williamson,David P
Committee Member
Renegar,James; Shmoys,David B
Degree Discipline
Operations Research
Degree Name
Ph. D., Operations Research
Degree Level
Doctor of Philosophy
Type
dissertation or thesis