Variable neighborhood search algorithm for the robust p-median problem | Sciact - Система учета научной деятельности ИМ СО РАН

Variable neighborhood search algorithm for the robust p-median problem Научная публикация

Журнал

Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795

Вых. Данные

Год: 2026, Том: 300, DOI: 10.1007/s10958-026-08531-y

Авторы

Levanova Tatiana ¹ , Khmara Ivan ¹

Организации

1	Omsk Branch of the Sobolev Institute of Mathematics SB RAS, 13, Pevtsova st., Omsk, 644043, Russia

Информация о финансировании (1)

Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».

FWNF-2022-0020

We consider the robust p-median problem, where the stability associated with consumer demand is optimized. Since the known software requires high CPU time and memory, we develop approximate methods. We propose a problem-oriented version of the variable neighborhood search algorithm. The results are compared with known results, and the experimental data are discussed.

Levanova T. , Khmara I.
Variable neighborhood search algorithm for the robust p-median problem
Journal of Mathematical Sciences (United States). 2026. V.300. DOI: 10.1007/s10958-026-08531-y Scopus OpenAlex

Поступила в редакцию:	20 дек. 2024 г.
Принята к публикации:	10 июн. 2026 г.
Опубликована online:	24 июн. 2026 г.

≡ Scopus:	2-s2.0-105042621227
≡ OpenAlex:	W7165648381