Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

1 Citation (Scopus)
Original languageEnglish
Title of host publicationOptimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers
PublisherSpringer Verlag
Pages68-77
Number of pages10
ISBN (Print)9783319937991
DOIs
Publication statusPublished - 1 Jan 2018
Event7th International Conference on Optimization Problems and Their Applications, OPTA 2018 - Omsk, Russian Federation
Duration: 7 Jun 201813 Jun 2018

Publication series

NameCommunications in Computer and Information Science
Volume871
ISSN (Print)1865-0929

Conference

Conference7th International Conference on Optimization Problems and Their Applications, OPTA 2018
CountryRussian Federation
CityOmsk
Period07/06/201813/06/2018

Fingerprint

Traveling salesman problem
Tractability
Travelling salesman problems
Euclidean
Grid
Polynomials
Number of Clusters
Optimal Algorithm
Polynomial-time Algorithm
Time Complexity
Optimality
Polynomial time
Exceed
Sharing
NP-complete problem
Approximation

Keywords

  • Generalized traveling salesman problem
  • Polynomial time solvability
  • Pseudo-pyramidal tour

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Khachay, M., & Neznakhina, K. (2018). Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. In Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers (pp. 68-77). (Communications in Computer and Information Science; Vol. 871). Springer Verlag. https://doi.org/10.1007/978-3-319-93800-4_6
Khachay, Michael ; Neznakhina, Katherine. / Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer Verlag, 2018. pp. 68-77 (Communications in Computer and Information Science).
@inproceedings{22a77ea2374d418481ae129926d061f2,
title = "Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height",
keywords = "Generalized traveling salesman problem, Polynomial time solvability, Pseudo-pyramidal tour",
author = "Michael Khachay and Katherine Neznakhina",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-93800-4_6",
language = "English",
isbn = "9783319937991",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "68--77",
booktitle = "Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers",
address = "Germany",

}

Khachay, M & Neznakhina, K 2018, Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. in Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Communications in Computer and Information Science, vol. 871, Springer Verlag, pp. 68-77, 7th International Conference on Optimization Problems and Their Applications, OPTA 2018, Omsk, Russian Federation, 07/06/2018. https://doi.org/10.1007/978-3-319-93800-4_6

Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. / Khachay, Michael; Neznakhina, Katherine.

Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer Verlag, 2018. p. 68-77 (Communications in Computer and Information Science; Vol. 871).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height

AU - Khachay, Michael

AU - Neznakhina, Katherine

PY - 2018/1/1

Y1 - 2018/1/1

KW - Generalized traveling salesman problem

KW - Polynomial time solvability

KW - Pseudo-pyramidal tour

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

U2 - 10.1007/978-3-319-93800-4_6

DO - 10.1007/978-3-319-93800-4_6

M3 - Conference contribution

SN - 9783319937991

T3 - Communications in Computer and Information Science

SP - 68

EP - 77

BT - Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers

PB - Springer Verlag

ER -

Khachay M, Neznakhina K. Towards tractability of the euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height. In Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer Verlag. 2018. p. 68-77. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-319-93800-4_6