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.
