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)

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)