Mikhail Yu. Khachay

Orcid: 0000-0003-3555-0080

According to our database1, Mikhail Yu. Khachay authored at least 37 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm.
Eur. J. Oper. Res., September, 2023

Reliable Production Process Design Problem: Compact MILP Model and ALNS-Based Primal Heuristic.
Proceedings of the Optimization and Applications - 14th International Conference, 2023

2022
Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019).
J. Glob. Optim., 2022

Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio.
Proceedings of the Optimization and Applications - 13th International Conference, 2022

2021
Preface.
Optim. Methods Softw., 2021

Efficient approximation of the metric CVRP in spaces of fixed doubling dimension.
J. Glob. Optim., 2021

Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem.
Proceedings of the Optimization and Applications - 12th International Conference, 2021

The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2020
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters.
Ann. Math. Artif. Intell., 2020

PCGLNS: A Heuristic Solver for the Precedence Constrained Generalized Traveling Salesman Problem.
Proceedings of the Optimization and Applications - 11th International Conference, 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.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Library of Sample Image Instances for the Cutting Path Problem.
Proceedings of the Pattern Recognition. ICPR International Workshops and Challenges, 2020

2019
Attainable accuracy guarantee for the k-medians clustering in [0, 1].
Optim. Lett., 2019

Special issue dedicated to the 8th international conference on optimization and applications (OPTIMA 2017).
Optim. Lett., 2019

Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand.
Proceedings of the Analysis of Images, Social Networks and Texts, 2019

2018
Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Fully Convolutional Neural Networks for Mapping Oil Palm Plantations in Kalimantan.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Efficient PTAS for the Euclidean CVRP with Time Windows.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018

Application of Fully Convolutional Neural Networks to Mapping Industrial Oil Palm Plantations.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018

2017
Generalized Pyramidal Tours for the Generalized Traveling Salesman Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017

Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016
Approximability of the minimum-weight k-size cycle cover problem.
J. Glob. Optim., 2016

The Cropland Capture Game: Good Annotators Versus Vote Aggregation Methods.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2016

Approximation Algorithms for Generalized TSP in Grid Clusters.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d.
Proceedings of the Discrete Optimization and Operations Research, 2016

Vote Aggregation Techniques in the Geo-Wiki Crowdsourcing Game: A Case Study.
Proceedings of the Analysis of Images, Social Networks and Texts, 2016

2015
Committee polyhedral separability: complexity and polynomial approximation.
Mach. Learn., 2015

Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2015

Theoretical Approach to Developing Efficient Algorithms of Fingerprint Enhancement.
Proceedings of the Analysis of Images, Social Networks and Texts, 2015

2014
Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms.
Autom. Remote. Control., 2014

Fingerprint Identification Algorithm Based on Delaunay Triangulation and Cylinder Codes.
Proceedings of the Analysis of Images, Social Networks and Texts, 2014

2009
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position.
Informatica, 2009

2007
On the Computational Complexity of the Minimum Committee Problem.
J. Math. Model. Algorithms, 2007


  Loading...