dc.contributor.author | Ahmadian, Sara | |
dc.date.accessioned | 2010-09-28 13:46:31 (GMT) | |
dc.date.available | 2010-09-28 13:46:31 (GMT) | |
dc.date.issued | 2010-09-28T13:46:31Z | |
dc.date.submitted | 2010 | |
dc.identifier.uri | http://hdl.handle.net/10012/5513 | |
dc.description.abstract | We consider the lower-bounded facility location (LBFL) problem (, also known as load-balanced facility location), which is a generalization of uncapacitated facility location (UFL) problem where each open facility is required to serve a minimum number of clients. More formally, in the LBFL problem, we are given a set of clients Ɗ , a set of facilities Ƒ, a non-negative facility-opening cost f_i for each i ∈ Ƒ, a lower bound M, and a distance metric c(i,j) on the set Ɗ ∪ Ƒ, where c(i,j) denotes the cost of assigning client j to facility i. A feasible solution S specifies the set of open facilities F_S ⊆ Ƒ and the assignment of each client j to an open facility i(j) such that each open facility serves at least M clients. Our goal is to find feasible solution S that minimizes ∑_{i ∈ F_S} f_i + ∑_j c(i,j).
The current best approximation ratio for LBFL is 550. We substantially advance the state-of-the-art for LBFL by devising an approximation
algorithm for LBFL that achieves a significantly-improved approximation guarantee of
83. | en |
dc.language.iso | en | en |
dc.publisher | University of Waterloo | en |
dc.subject | facility location | en |
dc.subject | lower-bounded facility location | en |
dc.subject | capacity-discounted facility location | en |
dc.subject | local-search algorithm | en |
dc.title | Improved approximation guarantees for lower-bounded facility location problem | en |
dc.type | Master Thesis | en |
dc.pending | false | |
dc.subject.program | Combinatorics and Optimization | en |
uws-etd.degree.department | Combinatorics and Optimization | en |
uws-etd.degree | Master of Mathematics | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Unreviewed | en |
uws.scholarLevel | Graduate | en |