Edward Gimadi

17 papers Misc 2Journal 6Unranked 9
YearRankTypeTitle / Venue / Authors
2021 Misc conf
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs.
AIST
Alexander A. Ageev, Edward Gimadi, Alexandr A. Shtepa
2020 — conf
On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem.
AIST (Supplement)
Edward Gimadi, Ivan A. Rykov
2017 Misc conf
An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity.
AIST
Edward Gimadi
2016 — conf
Efficient Randomized Algorithm for a Vector Subset Problem.
DOOR
Edward Gimadi, Ivan A. Rykov
2016 — conf
On Formulation and Software Implementation of Some Financial Management and Barter Transactions Problems.
DOOR (Supplement)
Edward Gimadi, Evgenii N. Goncharov, Valentin V. Leonov
2015 J jnl
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph.
Appl. Math. Comput.
Edward Gimadi
2009 J jnl
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
Discret. Appl. Math.
Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos
2006 J jnl
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electron. Notes Discret. Math.
Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos
2006 J jnl
Asymptotically optimal approach for solving some hard discrete optimization problems.
Electron. Notes Discret. Math.
Edward Gimadi
2006 J jnl
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors.
Electron. Notes Discret. Math.
Edward Gimadi, Alexey Baburin, Alexei N. Glebov, Artem V. Pyatkin
2006 — conf
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight.
OR
Alexey Baburin, Edward Gimadi
2005 — conf
On Some Probability Inequalities for Some Discrete Optimization Problems.
OR
Edward Gimadi
2004 — conf
Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees.
OR
Alexey Baburin, Edward Gimadi
2002 — conf
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign.
OR
Edward Gimadi, Sergey V. Sevastianov
2001 — conf
Multi-index assignment problem: an asymptotically optimal approach.
ETFA (2)
Edward Gimadi, Natalie Kairan
2001 J jnl
Multi-index axial assignment problem on single-cyclic permutations.
Electron. Notes Discret. Math.
Edward Gimadi, Natalie Kairan
2001 — conf
On the project scheduling problem under stored resource constraints.
ETFA (2)
Edward Gimadi, Sergey V. Sevastianov, V. V. Zalyubovsky