@article{ba01ee6442e242778f1f1cf5911c9f8c,
title = "Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension",
keywords = "cycle cover of size k, traveling salesman problem (TSP), NP-hard problem, polynomial-time approximation scheme (PTAS), SALESMAN PROBLEM",
author = "Michael Khachay and Katherine Neznakhina",
year = "2016",
doi = "10.1016/j.ifacol.2016.07.541",
language = "English",
volume = "49",
pages = "6--10",
journal = "Ifac papersonline",
issn = "2405-8963",
publisher = "Elsevier BV",
number = "12",
note = "8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM) ; Conference date: 28-06-2016 Through 30-06-2016",
}