Efficient solution method for Generalized Travelling Salesman Problem with precedence constraints of a special type

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)191-199
Number of pages9
JournalCEUR Workshop Proceedings
Volume1662
Publication statusPublished - 2016

Fingerprint

Traveling salesman problem
Combinatorial optimization
Dynamic programming
Polynomials

Keywords

  • Asymmetric Generalized Traveling Salesman Problem (AGTSP)
  • Dynamic programming
  • NP-hard problem

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

@article{4ab660de6f3a4bb3846df262cca00e26,
title = "Efficient solution method for Generalized Travelling Salesman Problem with precedence constraints of a special type",
keywords = "Asymmetric Generalized Traveling Salesman Problem (AGTSP), Dynamic programming, NP-hard problem",
author = "Chentsov, {Alexander G.} and Khachay, {Daniel M.}",
year = "2016",
language = "English",
volume = "1662",
pages = "191--199",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Efficient solution method for Generalized Travelling Salesman Problem with precedence constraints of a special type

AU - Chentsov, Alexander G.

AU - Khachay, Daniel M.

PY - 2016

Y1 - 2016

KW - Asymmetric Generalized Traveling Salesman Problem (AGTSP)

KW - Dynamic programming

KW - NP-hard problem

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

M3 - Article

VL - 1662

SP - 191

EP - 199

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -