Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2376
DC FieldValueLanguage
dc.contributor.authorDrakulić, D.en_US
dc.contributor.authorTakači, Aleksandaren_US
dc.contributor.authorMarić, Miroslaven_US
dc.date.accessioned2025-08-27T15:09:31Z-
dc.date.available2025-08-27T15:09:31Z-
dc.date.issued2016-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/2376-
dc.description.abstractThe 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.en_US
dc.language.isoenen_US
dc.publisherBelgrade : Society for Information Systems and Computer Networksen_US
dc.titleThe Minimal Covering Location Problem with single and multiple location coverageen_US
dc.typeConference Objecten_US
dc.relation.conferenceInternational Conference on Information Society and Technology (6 ; 2016 ; Kopaonik)en_US
dc.relation.publication6th International Conference on Information Society and Technology ICIST2016 - Proceedingsen_US
dc.identifier.doihttps://www.eventiotic.com/eventiotic/files/books/icist2016.pdf-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.isbn978-86-85525-18-6en_US
dc.description.rankM33en_US
dc.relation.firstpage263en_US
dc.relation.lastpage266en_US
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypeConference Object-
item.cerifentitytypePublications-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-7446-0577-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.