Approximability of the minimum-weight k-size cycle cover problem

Research output: Contribution to journalArticleResearchpeer-review

12 Citations (Scopus)
Original languageEnglish
Pages (from-to)65-82
Number of pages18
JournalJournal of Global Optimization
Volume66
Issue number1
DOIs
Publication statusPublished - 1 Sep 2016

Fingerprint

Cycle Cover
Traveling salesman problem
Approximability
Euclidean
Polynomial approximation
Vehicle routing
Travelling salesman problems
Combinatorial optimization
Polynomials
Cover
Cycle
Metric
Polynomial Time Approximation Scheme
Costs
Vehicle Routing Problem
Combinatorial Optimization Problem
Digraph
Polynomial-time Algorithm
Approximation Algorithms
Disjoint

Keywords

  • Cycle cover problem (CCP)
  • NP-hard problem
  • Polynomial-time approximation scheme (PTAS)
  • Traveling salesman problem (TSP)

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

WoS ResearchAreas Categories

  • Operations Research & Management Science
  • Mathematics, Applied

Cite this

@article{bbaca1f41bae46049c1e7a14e406be62,
title = "Approximability of the minimum-weight k-size cycle cover problem",
keywords = "Cycle cover problem (CCP), NP-hard problem, Polynomial-time approximation scheme (PTAS), Traveling salesman problem (TSP)",
author = "Michael Khachay and Katherine Neznakhina",
year = "2016",
month = "9",
day = "1",
doi = "10.1007/s10898-015-0391-3",
language = "English",
volume = "66",
pages = "65--82",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Kluwer Academic Publishers",
number = "1",

}

Approximability of the minimum-weight k-size cycle cover problem. / Khachay, Michael; Neznakhina, Katherine.

In: Journal of Global Optimization, Vol. 66, No. 1, 01.09.2016, p. 65-82.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Approximability of the minimum-weight k-size cycle cover problem

AU - Khachay, Michael

AU - Neznakhina, Katherine

PY - 2016/9/1

Y1 - 2016/9/1

KW - Cycle cover problem (CCP)

KW - NP-hard problem

KW - Polynomial-time approximation scheme (PTAS)

KW - Traveling salesman problem (TSP)

UR - http://www.scopus.com/inward/record.url?scp=84950236779&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000382141100006

U2 - 10.1007/s10898-015-0391-3

DO - 10.1007/s10898-015-0391-3

M3 - Article

VL - 66

SP - 65

EP - 82

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 1

ER -