|
|
Publications in Math-Net.Ru
-
Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
Zh. Vychisl. Mat. Mat. Fiz., 64:6 (2024), 940–958
-
Approximation algorithms with constant factors for a series of asymmetric routing problems
Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023), 89–97
-
Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021), 1206–1219
-
Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
Dokl. RAN. Math. Inf. Proc. Upr., 493 (2020), 74–80
-
Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension
Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019), 235–248
-
Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows
Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018), 233–246
-
Recognition of zero bits of 3-sat problem by applying linear algebra’s methods
Computer Optics, 38:3 (2014), 521–528
-
Hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem
Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013), 285–294
© , 2026