Edward Gimadi
Orcid: 0000-0002-1349-405X
According to our database1,
Edward Gimadi
authored at least 38 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on mathnet.ru
On csauthors.net:
Bibliography
2024
An Asymptotically Optimal Algorithm for the Minimum Weight Spanning Tree with Arbitrarily Bounded Diameter on Random Inputs.
Proceedings of the Analysis of Images, Social Networks and Texts, 2024
2023
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter.
Autom. Remote. Control., July, 2023
The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph.
Proceedings of the Analysis of Images, Social Networks and Texts, 2023
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.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021
On Several Edge-Disjoint MSTs with Given Diameter in Undirected Graph with Exponentially Distributed Edge Weights.
Proceedings of the Recent Trends in Analysis of Images, Social Networks and Texts, 2021
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs.
Proceedings of the Analysis of Images, Social Networks and Texts, 2021
2020
Proceedings of the Optimization and Applications - 11th International Conference, 2020
On Asymptotically Optimal Solvability of Max m-k-Cycles Cover Problem in a Normed Space.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020
An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network.
Proceedings of the Recent Trends in Analysis of Images, Social Networks and Texts, 2020
Proceedings of the Recent Trends in Analysis of Images, Social Networks and Texts, 2020
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances.
Proceedings of the Analysis of Images, Social Networks and Texts, 2020
2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019
2018
Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018
On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018
2017
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
2016
Proceedings of the Discrete Optimization and Operations Research, 2016
Probabilistic Analysis of an Algorithm for the Uncapacitated Facility Location Problem on Unbounded Above Random Input Data.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs.
Proceedings of the Discrete Optimization and Operations Research, 2016
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
On Formulation and Software Implementation of Some Financial Management and Barter Transactions Problems.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
2015
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph.
Discret. Appl. Math., 2015
Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph.
Appl. Math. Comput., 2015
2011
2009
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
Discret. Appl. Math., 2009
2006
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electron. Notes Discret. Math., 2006
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors.
Electron. Notes Discret. Math., 2006
Asymptotically optimal approach for solving some hard discrete optimization problems.
Electron. Notes Discret. Math., 2006
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight.
Proceedings of the Operations Research, 2006
2005
Proceedings of the Operations Research Proceedings 2005, 2005
2004
Discret. Appl. Math., 2004
Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees.
Proceedings of the Operations Research, 2004
2002
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign.
Proceedings of the Operations Research Proceedings 2002, 2002
2001
Electron. Notes Discret. Math., 2001
On the connectedness property of service areas for the Network Facility Location Problem.
Electron. Notes Discret. Math., 2001
Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001
Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001