Effective calculation of all tolerances in the sparse maximin routing problem

Autores: Kaymakov K.V.¹, Malyshev D.S.²^,3
Afiliações:
2. National Research University Higher School of Economics
3. Moscow Institute of Physics and Technology (National Research University)
Edição: Volume 79, Nº 5 (2024)
Páginas: 185-186
Seção: SHORT MESSAGES
URL: https://bakhtiniada.ru/0042-1316/article/view/265549
DOI: https://doi.org/10.4213/rm10199
ID: 265549

Citar

Texto integral

Acesso aberto
Acesso é fechado

Acesso está concedido
Acesso é fechado

Somente assinantes

National Research University Higher School of Economics; Moscow Institute of Physics and Technology (National Research University)

Email: dsmalyshev@rambler.ru
Código SPIN: 1987-3057
Scopus Author ID: 25522390800
Researcher ID: J-8088-2015
Doctor of physico-mathematical sciences, Professor

M. Turkensteen, D. Malyshev, B. Goldengorin, P. M. Pardalos, J. Global Optim., 68:3 (2017), 601–622
M. Turkensteen, G. Jäger, Theoret. Comput. Sci., 937 (2022), 1–21
R. Ramaswamy, J. B. Orlin, N. Chakravarty, Math. Program., 102:2 (A) (2005), 355–369
J. Edmonds, R. M. Karp, J. ACM, 19:2 (1972), 248–264
G. Baier, E. Köhler, M. Skutella, Algorithms–ESA 2002, Lecture Notes in Comput. Sci., 2461, Springer-Verlag, Berlin, 2002, 101–113
K. V. Kaymakov, D. S. Malyshev, Optim. Lett., 18:5 (2024), 1273–1283
B. Dixon, M. Rauch, R. E. Tarjan, SIAM J. Comput., 21:6 (1992), 1184–1192
J. Fischer, V. Heun, Combinatorial pattern matching, Lecture Notes in Comput. Sci., 4009, Springer-Verlag, Berlin, 2006, 36–48
P. M. Camerini, Inform. Process. Lett., 7:1 (1978), 10–14

Ação

1. JATS XML