Minimised Weighted Covering of Service Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F16%3APU120374" target="_blank" >RIV/00216305:26210/16:PU120374 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Minimised Weighted Covering of Service Networks
Original language description
In this paper, we deal with the set covering problem, which consists in finding the minimum number of service centres providing specialized services within a reasonable distance given by a threshold. However, we consider not only the threshold, but also weights of service centres so that the most important ones would not be omitted from the final solution. Since even the basic task without weights belongs to the class of NP-hard problems, stochastic heuristic methods must be used for large instances of the problem.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10103 - Statistics and probability
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 17th International Carpathian Control Conference ICCC 2016
ISBN
978-1-4673-8605-0
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
645-650
Publisher name
Technical University Košice
Place of publication
Košice
Event location
Tatranská Lomnica
Event date
May 29, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000389829000120