Approximation algorithms for facility location problems


Share/Save/Bookmark

Bumb, Adriana Felicia (2002) Approximation algorithms for facility location problems. thesis.

[img]
Preview
PDF
753Kb
Abstract:Facility location problems are among the most well-studied problems in optimization literature. The simplest variant is the uncapacitated facility location problem, which we denoted by the UFLP. In the UFLP, we are given a set of possible facility locations and a set of clients. The problem seeks to find a set of locations to build/open facilities such that the sum of the cost of building/opening the facilities and the cost of serving each client from exactly one open facility is minimized. This problem is NP−hard. Therefore, many heuristics for finding good approximate solutions were developed. In this thesis we design approximation algorithms for several variants of the UFLP.
Item Type:Thesis
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/38644
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 207710