Multi-index assignment problem: an asymptotically optimal approach. - Edward Gimadi; Natalie Kairan (ETFA (2), 2001)

On the project scheduling problem under stored resource constraints. - Edward Gimadi; Sergey V. Sevastianov; V. V. Zalyubovsky (ETFA (2), 2001)

On the connectedness property of service areas for the Network Facility Location Problem. - Eduard Kh. Gimadi (Electron. Notes Discret. Math., 2001)

Multi-index axial assignment problem on single-cyclic permutations. - Edward Gimadi; Natalie Kairan (Electron. Notes Discret. Math., 2001)

On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. - Edward Gimadi; Sergey V. Sevastianov (OR, 2002)

Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. - Alexey Baburin; Edward Gimadi (OR, 2004)

On finding a cyclic tour and a vehicle loading plan yielding maximum profit. - Eduard Kh. Gimadi; N. I. Glebov; A. I. Serdyukov (Discret. Appl. Math., 2004)

On Some Probability Inequalities for Some Discrete Optimization Problems. - Edward Gimadi (OR, 2005)

Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. - Alexey Baburin; Edward Gimadi (OR, 2006)

Asymptotically optimal approach for solving some hard discrete optimization problems. - Edward Gimadi (Electron. Notes Discret. Math., 2006)

NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. - Edward Gimadi; Alexey Baburin; Alexei N. Glebov; Artem V. Pyatkin (Electron. Notes Discret. Math., 2006)

Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. - Yury Glazkov; Alexey Baburin; Edward Gimadi; Federico Della Croce; Vangelis Th. Paschos (Electron. Notes Discret. Math., 2006)

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. - Alexey Baburin; Federico Della Croce; Edward Gimadi; Y. V. Glazkov; Vangelis Th. Paschos (Discret. Appl. Math., 2009)

On some Hard-to-Solve versions of the Assignment Problem. - Eduard Kh. Gimadi (Stud. Inform. Univ., 2011)

Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph. - Edward Gimadi (Appl. Math. Comput., 2015)

Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. - Eduard Kh. Gimadi; Alexei N. Glebov; A. A. Skretneva; O. Yu. Tsidulko; D. Zh. Zambalaeva (Discret. Appl. Math., 2015)

On Formulation and Software Implementation of Some Financial Management and Barter Transactions Problems. - Edward Gimadi; Evgenii N. Goncharov; Valentin V. Leonov (DOOR (Supplement), 2016)

On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below. - Edward Khairutdinovich Gimadi; Alexey M. Istomin; Ekaterina Shin (DOOR (Supplement), 2016)

On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. - Edward Kh. Gimadi; Alexey M. Istomin; Oxana Yu. Tsidulko (DOOR, 2016)

Probabilistic Analysis of an Algorithm for the Uncapacitated Facility Location Problem on Unbounded Above Random Input Data. - Edward Khairutdinovich Gimadi; Anna A. Kurochkina; Elena A. Nagornaya (DOOR (Supplement), 2016)

Efficient Randomized Algorithm for a Vector Subset Problem. - Edward Gimadi; Ivan A. Rykov (DOOR, 2016)

An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity. - Edward Gimadi (AIST, 2017)

Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2017)

On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2018)

Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space. - Edward Kh. Gimadi; O. Yu. Tsidulko (LION, 2018)

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (LION, 2019)

On Given Diameter MST Problem on Random Input Data. - Edward Kh. Gimadi; Ekaterina Yu. Shin (MOTOR (2), 2019)

Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances. - Eduard Kh. Gimadi; Evgenii N. Goncharov; Alexandr A. Shtepa (AIST, 2020)

On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem. - Edward Gimadi; Ivan A. Rykov (AIST (Supplement), 2020)

An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network. - Edward Kh. Gimadi; Aleksandr S. Shevyakov (AIST (Supplement), 2020)

On Asymptotically Optimal Solvability of Max m-k-Cycles Cover Problem in a Normed Space. - Edward Kh. Gimadi; Ivan A. Rykov (MOTOR, 2020)

A Given Diameter MST on a Random Graph. - Edward Kh. Gimadi; Aleksandr S. Shevyakov; Alexandr A. Shtepa (OPTIMA, 2020)

How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs. - Alexander A. Ageev; Edward Gimadi; Alexandr A. Shtepa (AIST, 2021)

On Several Edge-Disjoint MSTs with Given Diameter in Undirected Graph with Exponentially Distributed Edge Weights. - Eduard Kh. Gimadi; Alexandr S. Shevyakov; Aleksandr A. Shtepa (AIST (Supplement), 2021)

On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with Random Edge Weights. - Edward Kh. Gimadi; Aleksandr S. Shevyakov; Alexandr A. Shtepa (MOTOR, 2021)

The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph. - Edward Khairutdinovich Gimadi; Alexandr A. Shtepa (AIST, 2023)

On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter. - Eduard Kh. Gimadi; Alexandr A. Shtepa (Autom. Remote. Control., 2023)

An Asymptotically Optimal Algorithm for the Minimum Weight Spanning Tree with Arbitrarily Bounded Diameter on Random Inputs. - Edward Kh. Gimadi; Oxana Yu. Tsidulko (AIST, 2024)