On the Computational Complexity of the Minimum Committee Problem. - Mikhail Yu. Khachay (J. Math. Model. Algorithms, 2007)

Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position. - Michael Yu. Khachay; Maria I. Poberii (Informatica, 2009)

Fingerprint Identification Algorithm Based on Delaunay Triangulation and Cylinder Codes. - Alexander Dremin; Mikhail Yu. Khachay; Anton Leshko (AIST, 2014)

Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms. - Mikhail Yu. Khachay; Maria I. Poberii (Autom. Remote. Control., 2014)

Theoretical Approach to Developing Efficient Algorithms of Fingerprint Enhancement. - Mikhail Yu. Khachay; Maxim Pasynkov (AIST, 2015)

Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem. - Michael Yu. Khachay; Helen Zaytseva (COCOA, 2015)

Committee polyhedral separability: complexity and polynomial approximation. - Michael Yu. Khachay (Mach. Learn., 2015)

Vote Aggregation Techniques in the Geo-Wiki Crowdsourcing Game: A Case Study. - Artem Baklanov; Steffen Fritz; Michael Yu. Khachay; Oleg Nurmukhametov; Carl F. Salk; Linda M. See; Dmitry Shchepashchenko (AIST, 2016)

PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d. - Michael Yu. Khachay; Roman Dubinin (DOOR, 2016)

Approximation Algorithms for Generalized TSP in Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (DOOR (Supplement), 2016)

The Cropland Capture Game: Good Annotators Versus Vote Aggregation Methods. - Artem Baklanov; Steffen Fritz; Michael Yu. Khachay; Oleg Nurmukhametov; Linda M. See (ICCSAMA, 2016)

Approximability of the minimum-weight k-size cycle cover problem. - Michael Yu. Khachay; Katherine Neznakhina (J. Glob. Optim., 2016)

Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes. - Daniel Khachay; Michael Yu. Khachay; Maria I. Poberiy (AIST, 2017)

Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (AIST, 2017)

Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem. - Michael Yu. Khachay; Katherine Neznakhina (COCOA (1), 2017)

Application of Fully Convolutional Neural Networks to Mapping Industrial Oil Palm Plantations. - Artem Baklanov; Michael Yu. Khachay; Maxim Pasynkov (AIST, 2018)

Efficient PTAS for the Euclidean CVRP with Time Windows. - Michael Yu. Khachay; Yuri Ogorodnikov (AIST, 2018)

Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan. - Artem Baklanov; Michael Yu. Khachay; Maxim Pasynkov (LION, 2018)

Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters. - Michael Yu. Khachay; Katherine Neznakhina (LION, 2018)

Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand. - Michael Yu. Khachay; Yuri Ogorodnikov (AIST, 2019)

PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows. - Michael Yu. Khachay; Yuri Ogorodnikov (LION, 2019)

Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand. - Michael Yu. Khachay; Yuri Ogorodnikov (MOTOR, 2019)

Special issue dedicated to the 8th international conference on optimization and applications (OPTIMA 2017). - Alexander P. Afanasiev; Michael Yu. Khachay; Yury Kochetov 001 (Optim. Lett., 2019)

Attainable accuracy guarantee for the k-medians clustering in [0, 1]. - Michael Yu. Khachay; Daniel Khachay (Optim. Lett., 2019)

Library of Sample Image Instances for the Cutting Path Problem. - Alexander Petunin; Alexander Khalyavka; Michael Yu. Khachay; Andrei Kudriavtsev; Pavel A. Chentsov; Efim Polishchuk; Stanislav Ukolov (ICPR Workshops (5), 2020)

QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension. - Michael Yu. Khachay; Yuri Ogorodnikov (LION, 2020)

An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension. - Michael Yu. Khachay; Yuri Ogorodnikov; Daniel Khachay (MOTOR, 2020)

PCGLNS: A Heuristic Solver for the Precedence Constrained Generalized Traveling Salesman Problem. - Michael Yu. Khachay; Andrei Kudriavtsev; Aleksandr A. Petunin (OPTIMA, 2020)

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. - Michael Yu. Khachay; Katherine Neznakhina (Ann. Math. Artif. Intell., 2020)

The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm. - Andrei Kudriavtsev; Daniel Khachay; Yuri Ogorodnikov; Jie Ren; Sheng Cheng Shao; Dong Zhang; Mikhail Yu. Khachay (LION, 2021)

Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem. - Michael Yu. Khachay; Stanislav Ukolov; Alexander Petunin (OPTIMA, 2021)

Efficient approximation of the metric CVRP in spaces of fixed doubling dimension. - Mikhail Yu. Khachay; Yuri Ogorodnikov; Daniel Khachay (J. Glob. Optim., 2021)

Preface. - Milojica Jacimovic; Mikhail Yu. Khachay; Yury Kochetov 001; Mikhail Posypkin (Optim. Methods Softw., 2021)

Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio. - Mikhail Yu. Khachay; Katherine Neznakhina; Ksenia Rizhenko (OPTIMA, 2022)

Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019). - Panos M. Pardalos; Michael Yu. Khachay; Yuri Kochetov 001 (J. Glob. Optim., 2022)

Reliable Production Process Design Problem: Compact MILP Model and ALNS-Based Primal Heuristic. - Roman Rudakov; Daniil Khachai; Yuri Ogorodnikov; Michael Yu. Khachay (OPTIMA, 2023)

Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm. - Daniil Khachai; Ruslan Sadykov; Olga Battaïa; Mikhail Yu. Khachay (Eur. J. Oper. Res., 2023)