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

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
Original languageEnglish
Pages (from-to)6-10
Number of pages5
JournalIfac papersonline
Volume49
Issue number12
DOIs
Publication statusPublished - 2016
Event8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM) - Troyes, France
Duration: 28 Jun 201630 Jun 2016

Keywords

  • cycle cover of size k
  • traveling salesman problem (TSP)
  • NP-hard problem
  • polynomial-time approximation scheme (PTAS)
  • SALESMAN PROBLEM

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this