Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2376| Title: | The Minimal Covering Location Problem with single and multiple location coverage | Authors: | Drakulić, D. Takači, Aleksandar Marić, Miroslav |
Affiliations: | Informatics and Computer Science | Issue Date: | 2016 | Rank: | M33 | Publisher: | Belgrade : Society for Information Systems and Computer Networks | Related Publication(s): | 6th International Conference on Information Society and Technology ICIST2016 - Proceedings | Conference: | International Conference on Information Society and Technology (6 ; 2016 ; Kopaonik) | Abstract: | 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/2376 | DOI: | https://www.eventiotic.com/eventiotic/files/books/icist2016.pdf |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.