Mikhail Yu. Khachay

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 6

Top Topics

Polynomial Time Approximation

Delaunay Triangulation

Prize Collecting

Branch And Bound

Top Venues

J. Glob. Optim.

Autom. Remote. Control.

Publications

Daniil Khachai, Ruslan Sadykov, Olga Battaia, Mikhail Yu. Khachay
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm. Eur. J. Oper. Res. 309 (2) (2023)
Mikhail Yu. Khachay, Katherine Neznakhina, Ksenia Rizhenko
Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio. OPTIMA (2022)
Andrei Kudriavtsev, Daniel Khachay, Yuri Ogorodnikov, Jie Ren, Sheng Cheng Shao, Dong Zhang, Mikhail Yu. Khachay
The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm. LION (2021)
Milojica Jacimovic, Mikhail Yu. Khachay, Yury Kochetov, Mikhail Posypkin
Preface. Optim. Methods Softw. 36 (4) (2021)
Mikhail Yu. Khachay, Yuri Ogorodnikov, Daniel Khachay
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension. J. Glob. Optim. 80 (3) (2021)
Mikhail Yu. Khachay, Maxim Pasynkov
Theoretical Approach to Developing Efficient Algorithms of Fingerprint Enhancement. AIST (2015)
Mikhail Yu. Khachay, Maria I. Poberii
Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms. Autom. Remote. Control. 75 (4) (2014)
Alexander Dremin, Mikhail Yu. Khachay, Anton Leshko
Fingerprint Identification Algorithm Based on Delaunay Triangulation and Cylinder Codes. AIST (2014)
Mikhail Yu. Khachay
On the Computational Complexity of the Minimum Committee Problem. J. Math. Model. Algorithms 6 (4) (2007)