Aplikace úlohy o pokrytí na hasební obvod stanice Ovčáry

This thesis deals with the set-covering problem which belongs to distribution problems of the linear programming and in a practice can be found in many forms. The main goal of the standard set-covering problem is the construction of a new operating station which contains a degree of danger, but this thesis is focused on one operating station and examines the decision about its construction like a station of type JPO I, the problem contains so-called degrees of danger. Thesis is based on the real data provided by Fire Brigade of the Central region (Hasičský záchranný sbor Středočeského kraje). The theory of the distribution problems and optimization system MPL (which is the problem solved by) is presented in the first part. There a reader can also find a little information from the history of The Fire Brigade of the Czech Republic (HZS ČR). In the next part there is the description of modification for examining area coverage of the territory, where fire units are included instead of operating stations.