Approximation of Euclidean k-size cycle cover problem

Michael Khachay; Katherine Neznakhina

Approximation of Euclidean k-size cycle cover problem

Результат исследований: Вклад в журнал › Статья

Язык оригинала	Английский
Страницы (с-по)	177-188
Число страниц	12
Журнал	Croatian Operational Research Review
Том	5
Номер выпуска	2
Состояние	Опубликовано - 2014

Предметные области WoS

Экономика

Ссылки

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

Цитировать

@article{df4c176e39d84a1aa6f0cdbeb2f48940,

title = "Approximation of Euclidean k-size cycle cover problem",

keywords = "vertex-disjoint cycle cover, Traveling Salesman Problem (TSP), NP-hard problem, polynomial-time approximation scheme (PTAS)",

author = "Michael Khachay and Katherine Neznakhina",

year = "2014",

language = "English",

volume = "5",

pages = "177--188",

journal = "Croatian Operational Research Review",

issn = "1848-0225",

publisher = "Croatian Operational Research Society",

number = "2",

}

TY - JOUR

T1 - Approximation of Euclidean k-size cycle cover problem

AU - Khachay, Michael

AU - Neznakhina, Katherine

PY - 2014

Y1 - 2014

KW - vertex-disjoint cycle cover

KW - Traveling Salesman Problem (TSP)

KW - NP-hard problem

KW - polynomial-time approximation scheme (PTAS)

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

M3 - Article

VL - 5

SP - 177

EP - 188

JO - Croatian Operational Research Review

JF - Croatian Operational Research Review

SN - 1848-0225

IS - 2

ER -