Prikaz osnovnih podataka o dokumentu

dc.contributor.authorKontrec, Nataša
dc.contributor.authorPanić, Biljana
dc.contributor.authorTošić, Marina
dc.contributor.authorVujošević, Mirko
dc.date.accessioned2022-10-31T10:54:48Z
dc.date.available2022-10-31T10:54:48Z
dc.date.issued2020-10-31
dc.identifier.citationTR35030en_US
dc.identifier.isbn978-608-4904-09-0
dc.identifier.urihttps://platon.pr.ac.rs/handle/123456789/811
dc.description.abstractThis paper presents an approach for solving the maximum reliability k-center location problem. We are modifying the well-known p-center problem in order to determine the location of the observed objects and maximize the reliability of supply system coverage. The problem is defined as a stochastic problem of multi-center location on a graph. As a solution, two new algorithms have been proposed. The first is modified Dijkstra’s algorithm for determination of the most reliable paths between nodes in the graph. The output of this algorithm is used as an input for the second algorithm designed to find the reliability of node coverage from a predetermined number of nodes.en_US
dc.language.isoen_USen_US
dc.publisherUnion of Mathematicians of Macedonia - ARMAGANKAen_US
dc.titleMAXIMUM RELIABILITY K-CENTER LOCATION PROBLEMen_US
dc.title.alternativeProceedings of the CODEMA 2020en_US
dc.typekonferencijski-prilogen_US
dc.description.versionpublishedVersionen_US
dc.citation.spage81
dc.citation.epage91
dc.type.mCategoryM33en_US
dc.type.mCategoryopenAccessen_US
dc.type.mCategoryM33en_US
dc.type.mCategoryopenAccessen_US


Dokumenti

Thumbnail

Ovaj rad se pojavljuje u sledećim kolekcijama

Prikaz osnovnih podataka o dokumentu