The following pages link to Mikhail Yu. Khachay (Q928676):
Displayed 50 items.
- Item:Q928676 (redirect page) (← links)
- Item:Q330501 (redirect page) (← links)
- Item:Q330501 (redirect page) (← links)
- Item:Q330501 (redirect page) (← links)
- Item:Q330501 (redirect page) (← links)
- Item:Q330501 (redirect page) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Ivan Ivanovich Eremin (January 22, 1933 -- July 21, 2013) (Q492268) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning (Q643804) (← links)
- Sigma-compactness of metric Boolean algebras and uniform convergence of frequencies to probabilities (Q643814) (← links)
- Combinatorial optimization problems related to the committee polyhedral separability of finite sets (Q735652) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- On the computational complexity of the minimum committee problem (Q928677) (← links)
- Computational complexity of the minimum committee problem and related problems (Q1005473) (← links)
- On a relation associated with decision making by majority voting. (Q1432628) (← links)
- Estimate of the number of members in the minimal committee of a system of linear inequalities (Q1569404) (← links)
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← links)
- Generalized pyramidal tours for the generalized traveling salesman problem (Q1699787) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Committees of systems of linear inequalities (Q1778972) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand (Q1982923) (← links)
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
- Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows (Q2026157) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand (Q2181770) (← links)
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641) (← links)
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension (Q2243777) (← links)
- Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities (Q2261712) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Parallel computations and committee constructions (Q2458086) (← links)
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension (Q2663721) (← links)
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem (Q2679785) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- (Q2736216) (← links)
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$ (Q3133213) (← links)
- (Q3395298) (← links)
- (Q3440943) (← links)
- (Q3440997) (← links)
- Approximation of Euclidean k-size cycle cover problem (Q3455967) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- (Q4441581) (← links)
- (Q4451583) (← links)
- On the existence of majority committee (Q4522734) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)
- (Q5316965) (← links)
- (Q5325265) (← links)
- (Q5754127) (← links)