2004•Unpublished venueRequires access

Facility Location and Covering Problems

Jurij Miheli�, Borut Robi�

Abstract

discuss the connection between facility location prob- lems and covering problems, and present approaches to solving facility location problems by reducing them to cov- ering problems. In particular, we discuss the following NP-hard optimization problems: the set cover and the re- lated set cover facility location problem, the k-center and k-suppliers problem, the dominating set problem, the max- imum independent set problem, and the maximum covering problem.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Facility location problem, Set cover problem, 1-center problem, Covering problems, Cover (algebra), Set (abstract data type), Dominating set, Computer science