| Publication | Date of Publication | Type |
|---|
| Reliable production process design problem: compact MILP model and ALNS-based primal heuristic | 2024-08-16 | Paper |
Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
Computational Mathematics and Mathematical Physics | 2024-08-15 | Paper |
Approximation algorithms with constant factors for a series of asymmetric routing problems
Doklady Mathematics | 2024-03-19 | Paper |
Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
Proceedings of the Steklov Institute of Mathematics | 2024-02-16 | Paper |
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
Ural mathematical journal | 2023-10-05 | Paper |
Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
Optimization and Applications | 2023-08-10 | Paper |
Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
European Journal of Operational Research | 2023-07-10 | Paper |
| Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem | 2023-04-13 | Paper |
Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
Proceedings of the Steklov Institute of Mathematics | 2023-03-09 | Paper |
| PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem | 2023-01-25 | Paper |
Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
Doklady Mathematics | 2021-11-11 | Paper |
| Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand | 2021-09-14 | Paper |
Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Computational Mathematics and Mathematical Physics | 2021-08-24 | Paper |
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
Journal of Global Optimization | 2021-08-17 | Paper |
| Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows | 2021-05-18 | Paper |
| An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension | 2021-04-19 | Paper |
Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
Proceedings of the Steklov Institute of Mathematics | 2020-06-05 | Paper |
| Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand | 2020-05-19 | Paper |
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Annals of Mathematics and Artificial Intelligence | 2020-02-11 | Paper |
Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
Optimization Letters | 2019-12-03 | Paper |
On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line
Ural mathematical journal | 2018-08-17 | Paper |
Approximation schemes for the generalized traveling salesman problem
Proceedings of the Steklov Institute of Mathematics | 2018-04-20 | Paper |
| Generalized pyramidal tours for the generalized traveling salesman problem | 2018-02-26 | Paper |
PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
Proceedings of the Steklov Institute of Mathematics | 2017-10-27 | Paper |
Approximability of the minimum-weight \(k\)-size cycle cover problem
Journal of Global Optimization | 2016-10-26 | Paper |
Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Approximation of Euclidean \(k\)-size cycle cover problem
Croatian operational research review | 2015-12-11 | Paper |
Committee polyhedral separability: complexity and polynomial approximation
Machine Learning | 2015-11-10 | Paper |
Approximability of the problem about a minimum-weight cycle cover of a graph
Doklady Mathematics | 2015-08-21 | Paper |
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
Proceedings of the Steklov Institute of Mathematics | 2015-08-20 | Paper |
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
Proceedings of the Steklov Institute of Mathematics | 2015-08-20 | Paper |
Ivan Ivanovich Eremin (January 22, 1933 -- July 21, 2013)
Proceedings of the Steklov Institute of Mathematics | 2015-08-20 | Paper |
Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities
Automation and Remote Control | 2015-03-13 | Paper |
2-approximation algorithm for finding a clique with minimum weight of vertices and edges
Proceedings of the Steklov Institute of Mathematics | 2014-12-17 | Paper |
The computational complexity and approximability of a series of geometric covering problems
Proceedings of the Steklov Institute of Mathematics | 2014-12-16 | Paper |
Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
Automation and Remote Control | 2014-10-16 | Paper |
Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
Proceedings of the Steklov Institute of Mathematics | 2011-11-02 | Paper |
Sigma-compactness of metric Boolean algebras and uniform convergence of frequencies to probabilities
Proceedings of the Steklov Institute of Mathematics | 2011-11-02 | Paper |
Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
Automation and Remote Control | 2010-09-24 | Paper |
Combinatorial optimization problems related to the committee polyhedral separability of finite sets
Proceedings of the Steklov Institute of Mathematics | 2009-10-23 | Paper |
| scientific article; zbMATH DE number 5598224 (Why is no real title available?) | 2009-08-25 | Paper |
| scientific article; zbMATH DE number 5592483 (Why is no real title available?) | 2009-08-08 | Paper |
Computational complexity of the minimum committee problem and related problems
Doklady Mathematics | 2009-03-09 | Paper |
On the computational complexity of the minimum committee problem
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-06-11 | Paper |
Parallel computations and committee constructions
Automation and Remote Control | 2007-10-31 | Paper |
| scientific article; zbMATH DE number 5181446 (Why is no real title available?) | 2007-08-21 | Paper |
| scientific article; zbMATH DE number 5158960 (Why is no real title available?) | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5158920 (Why is no real title available?) | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 2205648 (Why is no real title available?) | 2005-09-15 | Paper |
Committees of systems of linear inequalities
Automation and Remote Control | 2005-06-17 | Paper |
On a relation associated with decision making by majority voting.
Doklady Mathematics | 2004-06-15 | Paper |
| scientific article; zbMATH DE number 2047437 (Why is no real title available?) | 2004-02-29 | Paper |
| scientific article; zbMATH DE number 2021839 (Why is no real title available?) | 2004-01-06 | Paper |
Committee constructions.
Izvestiya Ural'skogo Gosudarstvennogo Universiteta. Matematika i Mekhanika | 2001-08-29 | Paper |
On the existence of majority committee
Discrete Mathematics and Applications | 2001-08-14 | Paper |
Estimate of the number of members in the minimal committee of a system of linear inequalities
Computational Mathematics and Mathematical Physics | 2000-07-04 | Paper |
