Discrete optimization, operations research, designing polynomial algorithvs with performance bounds for solving hard discrete optimization problems.
Main publications:
E. Kh. Gimadi. Effective algorithms for solving multi-level plant location problems // Operations Research and Discrete Analysis, Kluwer Academic Publishers, Dordrecht, 1997, P. 51–69 .
E. Kh. Gimadi. Exact Algorithm for Some Multi-level Location Problems on a Chain and a Tree // Oper. Research Proceedings, Springer-Verlag, Berlin, 1997. P. 72–77.
Gimadi E. Kh., Zalyubovskii V. V., and Sharygin P. I. The problem of strip packing: an asymptotically exact approach // Russian Mathematics (Iz. VUZ), Allerton Press Inc., 1997, Vol. 41, N 12, P. 32–42.
.Gimadi E. Kh., Serdyukov A. I., Axial three-index assignment and traveling salesman problems: fast approximation algorithms and their probabilistic analysis // Russian Mathematics (Iz. VUZ), Allerton Press Inc., 1999, Vol. 43, No. 12, P. 16–22.
Gimadi E. Kh., Serdyukov A. I. Problem of Finding the Maximal Spanning Connected Subgraph with Given Vertex Degrees // Oper. Res. Proceed. 2000 (Eds. Fleishman B. at al.) Springer, Berlin, 2001, P. 55–59.
Alexander Barvinok, Edward Kh. Gimadi, Anatoly I. Serdyukov. The Maximum TSP // Chapter 12 in the book: The Travelling Salesman Problem and Its Variations (Eds. G. Gutin and A. Punnen), Kluwer Academic Publishers, Dordrecht / Boston / London, 2002. P. 585–608.
Gimadi E. Kh., Glebov N. I., Serdyukov A. I. On finding a cyclic tour and a vehicle loading plan yielding maximum profit // Discrete Applied Mathematics. Elsevier, 135, 2004, P. 105–111.
Baburin E., Gimadi Edward Kh. Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight // Operations Research Proceedings 2006, Selected Papers. International Conference OR 2006, Karlsruhe, Springer, Berlin, 2007, P. 283–289.
Baburin E., Gimadi Edward Kh. Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight // Operations Research Proceedings 2006, Selected Papers. International Conference OR 2006, Karlsruhe, Springer, Berlin, 2007, P. 283–289.
Ageev Alexander A., Baburin Alexei E., Gimadi Edward Kh. A 3/4 approximation algorithms for finding two disjoint Hamiltonian cycles of maximum weight // Journal of Applied and Industrial Mathematics, Vol. 1, No. 2, 2007. P. 142–147.
A. E. Baburin, E. Kh. Gimadi. Certain generalization of the maximum traveling salesman problem // Journal of Applied and Industrial Mathematics, Vol. 1, No. 4, 2007. P. 418–423.
Gimadi E. Kh, Glazkov Yu. V. An asymptotically optimal algorithm for one modification of planar three-index assignment problem // Journal of Applied and Industrial Mathematics, Vol. 1, No. 4, 2007. P. 442–452.
E. Kh. Gimadi, A. A. Shtepa, “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; Autom. Remote Control, 84:7 (2023), 872–888
2022
2.
A. A. Ageev, E. Kh. Gimadi, O. Yu. Tsidulko, A. A. Shtepa, “Capacitated Facility Location Problem on tree-like graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022), 24–44
2021
3.
E. Kh. Gimadi, E. N. Goncharov, A. A. Shtepa, “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
2020
4.
E. Kh. Gimadi, O. Yu. Tsidulko, “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; Proc. Steklov Inst. Math. (Suppl.), 313, suppl. 1 (2021), S58–S72
2017
5.
E. Kh. Gimadi, O. Yu. Tsidulko, “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; J. Appl. Industr. Math., 11:3 (2017), 354–361
E. Kh. Gimadi, “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; Proc. Steklov Inst. Math. (Suppl.), 303, suppl. 1 (2018), 87–93
E. Kh. Gimadi, E. Yu. Shin, “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; J. Appl. Industr. Math., 9:4 (2015), 480–488
E. Kh. Gimadi, I. A. Rykov, “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; J. Appl. Industr. Math., 9:3 (2015), 351–357
E. Kh. Gimadi, I. A. Rykov, “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; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 57–67
E. Kh. Gimadi, Yu. V. Glazkov, O. Yu. Tsidulko, “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; J. Appl. Industr. Math., 8:2 (2014), 208–217
E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “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; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 88–101
E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, O. Yu. Tsidulko, “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; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 77–87
E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, “On 2-Capacitated Peripatetic Salesman Problem with Different Weight Functions”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:3 (2014), 3–18
E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, “On $m$-capacitated peripatetic salesman problem”, Diskretn. Anal. Issled. Oper., 20:5 (2013), 13–30; J. Appl. Industr. Math., 8:1 (2014), 40–52
I. I. Eremin, E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “$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; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 87–95
E. Kh. Gimadi, A. V. Shakhshneyder, “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; Autom. Remote Control, 73:2 (2012), 323–335
E. Kh. Gimadi, A. A. Kurochkin, “Effective algorithm for solving a two-level facility location problem on a tree-like network”, Diskretn. Anal. Issled. Oper., 19:6 (2012), 9–22; J. Appl. Industr. Math., 7:2 (2013), 177–186
E. Kh. Gimadi, E. V. Ivonina, “Approximation algorithms for maximum-weight problem of two-peripatetic salesmen”, Diskretn. Anal. Issled. Oper., 19:1 (2012), 17–32; J. Appl. Industr. Math., 6:3 (2012), 295–305
E. Kh. Gimadi, V. T. Dementev, “Probabilistic analysis of decentralized version of оne generalization of the assignment problem”, Diskretn. Anal. Issled. Oper., 18:3 (2011), 11–20
20.
E. Kh. Gimadi, A. A. Kurochkin, “Uniform Capacitated Facility Location Problem with Random Input Data”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:1 (2011), 15–34; J. Math. Sci., 188:4 (2013), 359–377
2010
21.
E. Kh. Gimadi, “On probabilistic analysis of one approximation algorithm for the $p$-median problem”, Diskretn. Anal. Issled. Oper., 17:3 (2010), 19–31
A. E. Baburin, E. Kh. Gimadi, “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; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S1–S13
E. Kh. Gimadi, E. N. Goncharov, V. V. Zalyubovsky, N. I. Plyaskina, V. N. Kharitonova, “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
A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin, “Polynomial algorithm for the path facility location problem with uniform capacities”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 3–18
E. Kh. Gimadi, A. V. Pyatkin, I. A. Rykov, “On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 11–19; J. Appl. Industr. Math., 4:1 (2010), 48–53
E. Kh. Gimadi, Yu. V. Glazkov, I. A. Rykov, “The vector subset problem with integer coordinates in Euclidean space with the maximum sum”, Diskretn. Anal. Issled. Oper., 15:4 (2008), 30–43; J. Appl. Industr. Math., 3:3 (2009), 343–352
E. Kh. Gimadi, A. Le Gallu, A. V. Sakhshneider, “Вероятностный анализ одного алгоритма приближённого решения задачи коммивояжёра на неограниченных сверху входных данных”, Diskretn. Anal. Issled. Oper., 15:1 (2008), 23–43; J. Appl. Industr. Math., 3:2 (2009), 207–221
E. Kh. Gimadi, “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; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S57–S67
E. Kh. Gimadi, Yu. V. Glazkov, A. N. Glebov, “Алгоритмы приближённого решения задачи о двух коммивояжёрах в полном графе с весами рёбер 1 и 2”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:2 (2007), 41–61; J. Appl. Industr. Math., 3:1 (2009), 46–60
A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 32–42; J. Appl. Industr. Math., 2:1 (2008), 32–38
A. E. Baburin, E. Kh. Gimadi, “Certain generalization of the maximum traveling salesman problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 3–12; J. Appl. Industr. Math., 1:4 (2007), 418–423
A. A. Ageev, A. E. Baburin, E. Kh. Gimadi, “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; J. Appl. Industr. Math., 1:2 (2007), 142–147
A. E. Baburin, E. Kh. Gimadi, “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; J. Appl. Industr. Math., 2:2 (2008), 155–166
E. Kh. Gimadi, E. N. Goncharov, “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.
E. Kh. Gimadi, A. V. Kel'manov, M. A. Kelmanova, S. A. Khamidullin, “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
A. E. Baburin, E. Kh. Gimadi, N. M. Korkishko, “Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 11–25
E. Kh. Gimadi, N. M. Korkishko, “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
A. E. Baburin, E. Kh. Gimadi, “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
I. P. Voznyuk, E. Kh. Gimadi, M. Yu. Filatov, “An asymptotically exact algorithm for solving the location problem with constrained production volumes”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001), 3–16
E. Kh. Gimadi, A. I. Serdyukov, “On some results for the maximum traveling salesman problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:1 (2001), 22–39
2000
42.
E. Kh. Gimadi, A. I. Serdyukov, “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
E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov, “Polynomial solvability of scheduling problems with storable resources and directive deadlines”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000), 9–34
E. Kh. Gimadi, N. M. Kairan, A. I. Serdyukov, “On the solvability of a multi-index axial assignment problem on one-cycle permutations”, Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 12, 21–26; Russian Math. (Iz. VUZ), 44:12 (2000), 19–24
E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov, “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
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii, “On problems of efficient barter”, Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998), 3–11
1997
48.
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii, “On some problems of mutual amortization of enterprises”, Diskretn. Anal. Issled. Oper., Ser. 2, 4:1 (1997), 30–39
E. Kh. Gimadi, V. V. Zalyubovskii, P. I. Sharygin, “The problem of strip packing: An asymptotically exact approach”, Izv. Vyssh. Uchebn. Zaved. Mat., 1997, no. 12, 34–44; Russian Math. (Iz. VUZ), 41:12 (1997), 32–42
E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov, “An algorithm for the approximate solution of the traveling salesman problem and its probabilistic analysis”, Sibirsk. Zh. Issled. Oper., 1:2 (1994), 8–17
E. Kh. Gimadi, N. I. Glebov, “The problem of rigging a hierarchical control and communications system”, Trudy Inst. Mat. SO RAN, 28 (1994), 53–62
1990
54.
E. Kh. Gimadi, N. K. Maksishko, “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
1989
55.
E. Kh. Gimadi, “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
1988
56.
E. Kh. Gimadi, “Some mathematical models and methods for the planning of large-scale projects”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988), 89–115
1987
57.
E. Kh. Gimadi, “Justification of a priori estimates for the quality of the approximate solution of a standardization problem”, Upravliaemie systemy, 1987, no. 27, 12–27
58.
E. Kh. Gimadi, “A standardization problem with data of arbitrary sign, and with connected quasiconvex and almost quasiconvex matrices”, Upravliaemie systemy, 1987, no. 27, 3–11
1984
59.
E. Kh. Gimadi, V. V. Zalyubovskii, “An asymptotically exact approach to the solution of a one-dimensional bin-packing problem”, Upravliaemie systemy, 1984, no. 25, 48–57
60.
E. Kh. Gimadi, “The problem of distribution on a network with centrally-connected service areas”, Upravliaemie systemy, 1984, no. 25, 38–47
1983
61.
E. Kh. Gimadi, N. M. Puzynina, “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.
E. Kh. Gimadi, “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
1974
63.
E. Kh. Gimadi, N. I. Glebov, V. T. Dement'ev, “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.
E. Kh. Gimadi, V. A. Perepelitsa, “An asymptotic approach to the solution of the travelling salesman problem”, Upravliaemie systemy, 1974, no. 12, 35–45
65.
E. Kh. Gimadi, N. I. Glebov, V. A. Perepelitsa, “Исследования по теории расписаний”, Upravliaemie systemy, 1974, no. 12, 3–10
1970
66.
E. Kh. Gimadi, “Выбop оптимальных шкал в одном классе задач типа размещения, унификации и стандартизации”, Upravliaemie systemy, 1970, no. 6, 57–70
1969
67.
E. Kh. Gimadutdinov, “Об одном классе задач нелинейного программирования”, Upravliaemie systemy, 1969, no. 3, 101–113
68.
E. Kh. Gimadutdinov, “О свойствах решений одной задачи оптимального размещения точек на отрезке”, Upravliaemie systemy, 1969, no. 2, 77–91
Contact us: