A Simulated Annealing for the Robust p-Median Problem Доклады на конференциях
| Язык | Английский | ||
|---|---|---|---|
| Тип доклада | Секционный | ||
| Конференция |
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 июл. 2025 , Новосибирск |
||
| Авторы |
|
||
| Организации |
|
Реферат:
A variant of the simulated annealing algorithm is proposed for the robust p-median problem. This algorithm belongs to local search methods and has previously proven itself well in solving complex combinatorial problems. A description of the proposed version of the algorithm is given, and the results of numerical experiments are analyzed.
Библиографическая ссылка:
Levanova T.
, Khmara I.
A Simulated Annealing for the Robust p-Median Problem
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 Jul 2025
A Simulated Annealing for the Robust p-Median Problem
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 Jul 2025