Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters

Michael Khachay, K. Neznakhina

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

4 Citations (Scopus)
Original languageEnglish
Title of host publicationAnalysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers
PublisherSpringer Verlag
Pages346-355
Number of pages10
Volume10716 LNCS
ISBN (Print)9783319730127
DOIs
Publication statusPublished - 1 Jan 2018
Event6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017 - Moscow, Russian Federation
Duration: 27 Jul 201729 Jul 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10716 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017
CountryRussian Federation
CityMoscow
Period27/07/201729/07/2017

Fingerprint

Traveling salesman problem
Travelling salesman problems
Polynomial time
Polynomials
Grid
Euclidean plane
Min-max
Dynamic programming
Dynamic Programming
NP-complete problem
Clustering
Unit
Cell
Graph in graph theory
Vertex of a graph

Keywords

  • Generalized traveling salesman
  • Grid clusters
  • Pyramidal tour

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

WoS ResearchAreas Categories

  • Computer Science, Information Systems
  • Computer Science, Theory & Methods

Cite this

Khachay, M., & Neznakhina, K. (2018). Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. In Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers (Vol. 10716 LNCS, pp. 346-355). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10716 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-73013-4_32
Khachay, Michael ; Neznakhina, K. / Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Vol. 10716 LNCS Springer Verlag, 2018. pp. 346-355 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e506a6a2c20e4e72baaaffb64a72e210,
title = "Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters",
keywords = "Generalized traveling salesman, Grid clusters, Pyramidal tour",
author = "Michael Khachay and K. Neznakhina",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-73013-4_32",
language = "English",
isbn = "9783319730127",
volume = "10716 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "346--355",
booktitle = "Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers",
address = "Germany",

}

Khachay, M & Neznakhina, K 2018, Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. in Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. vol. 10716 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10716 LNCS, Springer Verlag, pp. 346-355, 6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017, Moscow, Russian Federation, 27/07/2017. https://doi.org/10.1007/978-3-319-73013-4_32

Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. / Khachay, Michael; Neznakhina, K.

Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Vol. 10716 LNCS Springer Verlag, 2018. p. 346-355 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10716 LNCS).

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

TY - GEN

T1 - Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters

AU - Khachay, Michael

AU - Neznakhina, K.

PY - 2018/1/1

Y1 - 2018/1/1

KW - Generalized traveling salesman

KW - Grid clusters

KW - Pyramidal tour

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

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

U2 - 10.1007/978-3-319-73013-4_32

DO - 10.1007/978-3-319-73013-4_32

M3 - Conference contribution

SN - 9783319730127

VL - 10716 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 346

EP - 355

BT - Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers

PB - Springer Verlag

ER -

Khachay M, Neznakhina K. Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. In Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Vol. 10716 LNCS. Springer Verlag. 2018. p. 346-355. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-73013-4_32