RUS  ENG
Full version
PEOPLE

Gimadi Eduard Khairutdinovich

Publications in Math-Net.Ru

  1. On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter

    Avtomat. i Telemekh., 2023, no. 7,  146–166
  2. Capacitated Facility Location Problem on tree-like graphs

    Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022),  24–44
  3. A fast algorithm for finding a lower bound of the solution of the Resource-Constrained Project Scheduling Problem tested on PSPLIB instances

    Trudy Inst. Mat. i Mekh. UrO RAN, 27:1 (2021),  22–36
  4. On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines

    Trudy Inst. Mat. i Mekh. UrO RAN, 26:2 (2020),  108–124
  5. An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution

    Diskretn. Anal. Issled. Oper., 24:3 (2017),  5–19
  6. An optimal algorithm for an outerplanar facility location problem with improved time complexity

    Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  74–81
  7. Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded from below

    Diskretn. Anal. Issled. Oper., 22:4 (2015),  5–20
  8. A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum

    Diskretn. Anal. Issled. Oper., 22:3 (2015),  5–17
  9. Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles

    Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  89–99
  10. The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations

    Diskretn. Anal. Issled. Oper., 21:1 (2014),  15–29
  11. Efficient algorithms with performance estimates for some problems of finding several cliques in a complete undirected weighted graph

    Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  99–112
  12. Probabilistic analysis of an approximation algorithm for the $m$-peripatetic salesman problem on random instances unbounded from above

    Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  88–98
  13. On 2-Capacitated Peripatetic Salesman Problem with Different Weight Functions

    Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:3 (2014),  3–18
  14. On $m$-capacitated peripatetic salesman problem

    Diskretn. Anal. Issled. Oper., 20:5 (2013),  13–30
  15. $2$-approximate algorithm for finding a clique with minimum weight of vertices and edges

    Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  134–143
  16. Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

    Avtomat. i Telemekh., 2012, no. 2,  126–140
  17. Effective algorithm for solving a two-level facility location problem on a tree-like network

    Diskretn. Anal. Issled. Oper., 19:6 (2012),  9–22
  18. Approximation algorithms for maximum-weight problem of two-peripatetic salesmen

    Diskretn. Anal. Issled. Oper., 19:1 (2012),  17–32
  19. Probabilistic analysis of decentralized version of оne generalization of the assignment problem

    Diskretn. Anal. Issled. Oper., 18:3 (2011),  11–20
  20. Uniform Capacitated Facility Location Problem with Random Input Data

    Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:1 (2011),  15–34
  21. On probabilistic analysis of one approximation algorithm for the $p$-median problem

    Diskretn. Anal. Issled. Oper., 17:3 (2010),  19–31
  22. On the asymptotic accuracy of an algorithm for solving the $m$-PSP maximum problem in a multidimensional Euclidean space

    Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  12–24
  23. Optimization Technique for Resource-Constrained Project Scheduling Problem in East-Siberian Oil-Gas Project Planning

    Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:4 (2010),  52–67
  24. Polynomial algorithm for the path facility location problem with uniform capacities

    Diskretn. Anal. Issled. Oper., 16:5 (2009),  3–18
  25. On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension

    Diskretn. Anal. Issled. Oper., 15:6 (2008),  11–19
  26. The vector subset problem with integer coordinates in Euclidean space with the maximum sum

    Diskretn. Anal. Issled. Oper., 15:4 (2008),  30–43
  27. Вероятностный анализ одного алгоритма приближённого решения задачи коммивояжёра на неограниченных сверху входных данных

    Diskretn. Anal. Issled. Oper., 15:1 (2008),  23–43
  28. Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space

    Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  23–32
  29. Алгоритмы приближённого решения задачи о двух коммивояжёрах в полном графе с весами рёбер 1 и 2

    Diskretn. Anal. Issled. Oper., Ser. 2, 14:2 (2007),  41–61
  30. The problem of finding a subset of vectors with the maximum total weight

    Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  32–42
  31. Certain generalization of the maximum traveling salesman problem

    Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006),  3–12
  32. A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight

    Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006),  11–20
  33. An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a complete graph with random edge weights

    Diskretn. Anal. Issled. Oper., Ser. 2, 13:2 (2006),  3–20
  34. An asymptotically exact algorithm for one modification of planar three-index assignment

    Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006),  10–26
  35. A two-level choice problem for a system of machines and nodes with a nonlinear production function

    Sib. Zh. Ind. Mat., 9:2 (2006),  44–54
  36. A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence

    Sib. Zh. Ind. Mat., 9:1 (2006),  55–74
  37. Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight

    Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004),  11–25
  38. An algorithm for solving the three-index axial assignment problem on one-cycle permutations

    Diskretn. Anal. Issled. Oper., Ser. 1, 10:2 (2003),  56–65
  39. On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space

    Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  23–32
  40. An asymptotically exact algorithm for solving the location problem with constrained production volumes

    Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001),  3–16
  41. On some results for the maximum traveling salesman problem

    Diskretn. Anal. Issled. Oper., Ser. 2, 8:1 (2001),  22–39
  42. An algorithm for finding the minimum spanning tree with a diameter bounded from below

    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  3–11
  43. Polynomial solvability of scheduling problems with storable resources and directive deadlines

    Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000),  9–34
  44. On the solvability of a multi-index axial assignment problem on one-cycle permutations

    Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 12,  21–26
  45. Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis

    Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12,  19–25
  46. On a problem of the choice of a cyclic route and loading of transport vehicles

    Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998),  12–18
  47. On problems of efficient barter

    Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998),  3–11
  48. On some problems of mutual amortization of enterprises

    Diskretn. Anal. Issled. Oper., Ser. 2, 4:1 (1997),  30–39
  49. The problem of strip packing: An asymptotically exact approach

    Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  34–44
  50. Bin packing: Asymptotically exact approach

    Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12,  25–33
  51. Efficient algorithms for solving a multistage facility location problem on a path

    Diskretn. Anal. Issled. Oper., 2:4 (1995),  13–31
  52. An algorithm for the approximate solution of the traveling salesman problem and its probabilistic analysis

    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  8–17
  53. The problem of rigging a hierarchical control and communications system

    Trudy Inst. Mat. SO RAN, 28 (1994),  53–62
  54. Justification of conditions for the asymptotic exactness of an approximate algorithm for solving the traveling salesman problem on a maximum in the case of a discrete distribution

    Upravliaemie systemy, 1990, no. 30,  25–29
  55. The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm “go to the most remote city”

    Upravliaemie systemy, 1989, no. 29,  11–15
  56. Some mathematical models and methods for the planning of large-scale projects

    Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988),  89–115
  57. Justification of a priori estimates for the quality of the approximate solution of a standardization problem

    Upravliaemie systemy, 1987, no. 27,  12–27
  58. A standardization problem with data of arbitrary sign, and with connected quasiconvex and almost quasiconvex matrices

    Upravliaemie systemy, 1987, no. 27,  3–11
  59. An asymptotically exact approach to the solution of a one-dimensional bin-packing problem

    Upravliaemie systemy, 1984, no. 25,  48–57
  60. The problem of distribution on a network with centrally-connected service areas

    Upravliaemie systemy, 1984, no. 25,  38–47
  61. Problem of the calendar planning of a large-scale design under the conditions of limited resources: experience in the construction of software

    Upravliaemie systemy, 1983, no. 23,  24–32
  62. An efficient algorithm for solution of a distribution problem with servicing areas that are connected in relation to an acyclic network

    Upravliaemie systemy, 1983, no. 23,  12–23
  63. On a method of constructing a lower estimate and an approximate solution with an aposteriori exactness estimation for a standardization problem

    Upravliaemie systemy, 1974, no. 13,  26–31
  64. An asymptotic approach to the solution of the travelling salesman problem

    Upravliaemie systemy, 1974, no. 12,  35–45
  65. Исследования по теории расписаний

    Upravliaemie systemy, 1974, no. 12,  3–10
  66. Выбop оптимальных шкал в одном классе задач типа размещения, унификации и стандартизации

    Upravliaemie systemy, 1970, no. 6,  57–70
  67. Об одном классе задач нелинейного программирования

    Upravliaemie systemy, 1969, no. 3,  101–113
  68. О свойствах решений одной задачи оптимального размещения точек на отрезке

    Upravliaemie systemy, 1969, no. 2,  77–91

© Steklov Math. Inst. of RAS, 2025