Sciact
  • EN
  • RU

Variable neighborhood search algorithm for the robust p-median problem Full article

Journal Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795
Output data Year: 2026, Volume: 300, DOI: 10.1007/s10958-026-08531-y
Authors Levanova Tatiana 1 , Khmara Ivan 1
Affiliations
1 Omsk Branch of the Sobolev Institute of Mathematics SB RAS, 13, Pevtsova st., Omsk, 644043, Russia

Funding (1)

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

Abstract: 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.
Cite: 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
Dates:
Submitted: Dec 20, 2024
Accepted: Jun 10, 2026
Published online: Jun 24, 2026
Identifiers:
≡ Scopus: 2-s2.0-105042621227
≡ OpenAlex: W7165648381
Altmetrics: