On Asymptotically Optimal Solvability of Euclidean Max m-k-Cycles Cover Problem. | 0 | 0.34 | 2020 |
On Formulation and Software Implementation of Some Financial Management and Barter Transactions Problems. | 0 | 0.34 | 2016 |
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 | 4 | 0.61 | 2009 |
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors | 0 | 0.34 | 2006 |
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight | 1 | 0.37 | 2006 |
Asymptotically optimal approach for solving some hard discrete optimization problems | 0 | 0.34 | 2006 |
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2 | 0 | 0.34 | 2006 |
On Some Probability Inequalities for Some Discrete Optimization Problems | 2 | 0.46 | 2005 |
Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees | 4 | 0.91 | 2004 |
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. | 1 | 0.60 | 2002 |
Multi-index assignment problem: an asymptotically optimal approach | 0 | 0.34 | 2001 |
Multi-index axial assignment problem on single-cyclic permutations | 0 | 0.34 | 2001 |