1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2396
DC FieldValueLanguage
dc.contributor.authorDrakulić, D.en_US
dc.contributor.authorTakači, Aleksandaren_US
dc.contributor.authorMarić, Miroslaven_US
dc.date.accessioned2025-08-29T08:52:27Z-
dc.date.available2025-08-29T08:52:27Z-
dc.date.issued2016-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/2396-
dc.language.isoenen_US
dc.publisherPetru Maior' University Pressen_US
dc.relation.ispartofScientific Bulletin of the „Petru Maior” University of Tîrgu Mureşen_US
dc.titleSolving Minimal Covering Location Problems with Single and Multiple Node Coverageen_US
dc.typeArticleen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn1841-9267en_US
dc.relation.firstpage34en_US
dc.relation.lastpage38en_US
dc.relation.volume13en_US
dc.relation.issue2en_US
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypeArticle-
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


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