SOLVING A DEPLOYMENT PROBLEM WITH RESTRICTED AREAS

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21220%2F19%3A00328258" target="_blank" >RIV/68407700:21220/19:00328258 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21630/19:00328258
Result on the web
<a href="http://evlm.stuba.sk/APLIMAT/indexe.htm" target="_blank" >http://evlm.stuba.sk/APLIMAT/indexe.htm</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
SOLVING A DEPLOYMENT PROBLEM WITH RESTRICTED AREAS
Original language description
The article describes solving the Weber-Steiner’s problem with restricted areas, where the central point can not be placed. We consider the situation of a set defined points to which we want to insert a central point. We are looking for the optimal position of this central point to transportation costs between central point and the set points will be minimal. We are thinking also modifying this problem with restricted areas, where the central point can not be placed.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
18th Conference on Applied Mathematics APLIMAT 2019 PROCEEDINGS
ISBN
978-80-227-4884-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
685-690
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 5, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)