Solving Set Covering Problem Using Simulated Annealing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F19%3APR32074" target="_blank" >RIV/00216305:26220/19:PR32074 - isvavai.cz</a>
Result on the web
<a href="http://wislab.cz/our-work" target="_blank" >http://wislab.cz/our-work</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving Set Covering Problem Using Simulated Annealing
Original language description
Set Covering Problem is one of the most interesting problems of the current research. This work is solving the special version of set covering problem which includes the distances between service centres (hospitals, telecommunication devices, schools etc.) and customer locations (user devices, patients, schoolchildren).
Czech name
—
Czech description
—
Classification
Type
R - Software
CEP classification
—
OECD FORD branch
20202 - Communication engineering and systems
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
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
Internal product ID
Wislab SCP SA solver 1.0
Technical parameters
Ohledně možností získání licence prosím kontaktovat: doc. Ing. Jiří Hošek, Ph.D. tel.: +420 541 146 957 email: hosek@feec.vutbr.cz
Economical parameters
Ekonomické parametry nebyly analyzovány.
Owner IČO
—
Owner name
Ústav telekomunikací