1
2016.
The Minimal Covering Location Problem with single and multiple location coverage
The covering of Location Problems represents very important class of combinatorial problems. One of the most known problem from this class is Maximal Covering Location Problem (MCLP). Its objective is to cover as more as possible location with given facilities. The opposite problem is called Minimal (or Minimum) Covering Location Problem and its aim is to find places for given facilities such as they cover as few as possible location. This paper will present two models of MinCLP derived from the model of classical MCLP.