A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Polynomial Time Approximation Scheme for the Minimum-weight k-Size Cycle Cover Problem in Euclidean space of an arbitrary fixed dimension

2016
*
IFAC-PapersOnLine
*

We study the Min-k-SCCP on the partition of a complete weighted digraph by k vertex-disjoint cycles of minimum total weight. This problem is the generalization of the wellknown traveling salesman problem (TSP) and the special case of the classical vehicle routing problem (VRP). It is known that the problem Min-k-SCCP is strongly NP-hard and remains intractable even in the geometric statement. For the Euclidean Min-k-SCCP in R d , we construct a polynomial-time approximation scheme, which

doi:10.1016/j.ifacol.2016.07.541
fatcat:jzsopddbcfb4zjne2ij4lnpsha