Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/3755
DC FieldValueLanguage
dc.contributor.authorDrakulić, Darkoen
dc.contributor.authorTakači, Aleksandaren
dc.contributor.authorMarić, Miroslaven
dc.date.accessioned2019-09-23T10:29:48Z-
dc.date.available2019-09-23T10:29:48Z-
dc.date.issued2017-01-01en
dc.identifier.issn03545180en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/3755-
dc.description.abstract© 2017, University of Nis. All rights reserved. Covering location problems is well-known and very important class of combinatorial optimization problems. Standard models for covering location problems cannot encompass real-life problems, because real-life problems contain some degree of uncertainty. The use of fuzzy sets in modeling covering location problems allows the implementation of these conditions. Depending on the type of problems, it is necessary to use different aggregation operators in calculating solution’s quality. The aim of this study is introducing of fuzzy sets with different corresponding conorms in modeling most known types of covering location problems.en
dc.relation.ispartofFilomaten
dc.titleFuzzy covering location problems with different aggregation operatorsen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.2298/FIL1702513Den
dc.identifier.scopus2-s2.0-85014108001en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85014108001en
dc.relation.lastpage522en
dc.relation.firstpage513en
dc.relation.issue2en
dc.relation.volume31en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptTehnološki fakultet, Katedra za opšte inženjerske discipline-
crisitem.author.orcid0009-0008-4279-8010-
crisitem.author.parentorgTehnološki fakultet-
Appears in Collections:TF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

9
checked on May 10, 2024

Page view(s)

16
Last Week
11
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


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