Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters

Michael Khachay; Katherine Neznakhina

doi:10.1007/978-3-030-05348-2_38

Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers
Editors	Panos M. Pardalos, Roberto Battiti, Mauro Brunato, Ilias Kotsireas
Publisher	Springer Verlag
Pages	441-446
Number of pages	6
ISBN (Print)	9783030053475
DOIs	https://doi.org/10.1007/978-3-030-05348-2_38
Publication status	Published - 1 Jan 2019
Event	12th International Conference on Learning and Intelligent Optimization, LION 12 - Kalamata, Greece Duration: 10 Jun 2018 → 15 Jun 2018

Publication series

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

Conference

Conference	12th International Conference on Learning and Intelligent Optimization, LION 12
Country	Greece
City	Kalamata
Period	10/06/2018 → 15/06/2018

Keywords

Generalized traveling salesman problem
Polynomial time solvability
Pseudo-pyramidal tour

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

WoS ResearchAreas Categories

Computer Science, Interdisciplinary Applications
Operations Research & Management Science

Access to Document

10.1007/978-3-030-05348-2_38

Fingerprint Dive into the research topics of 'Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters'. Together they form a unique fingerprint.

1 Active

Научная лаборатория «Лаборатория оптимального раскроя промышленных материалов и оптимальных маршрутных технологий»
Петунин, А. А., Ченцов, П. А., Ченцов, А. Г., Сесекин, А. Н., Верхотуров, М. А., Картак, В. М., Fisher, A., Scheithauer, G., Мясогутов, М., Панюкова, Т. А., Кошелева, М. С., Полищук, Е. Г., Шипачёва, Е. Н., Репницкий, В. Б., Захарова, Г. Б., Полевов, А. В., Кротов, В. И., Галкин, И. С., Березин, И. М., Чернухин, В. И., Таваева, А. Ф., Фатехрад, М., Асанбеков, К. А., Панюков, А. В., Котел, Н. С., Уколов, С. С., Миронов, К. В., Салий, Я. В., Попов, В. Ю., Хачай, М. Ю., Иванко, Е. Е. & Савчук, А.
12/12/2013 → …
Project: Research › Research Laboratory

Cite this

Khachay, M., & Neznakhina, K. (2019). Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. In P. M. Pardalos, R. Battiti, M. Brunato, & I. Kotsireas (Eds.), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers (pp. 441-446). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11353 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05348-2_38

Khachay, Michael ; Neznakhina, Katherine. / Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. editor / Panos M. Pardalos ; Roberto Battiti ; Mauro Brunato ; Ilias Kotsireas. Springer Verlag, 2019. pp. 441-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5871eb93215e4d539195997bdfabfc29,

title = "Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters",

keywords = "Generalized traveling salesman problem, Polynomial time solvability, Pseudo-pyramidal tour",

author = "Michael Khachay and Katherine Neznakhina",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-05348-2_38",

language = "English",

isbn = "9783030053475",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "441--446",

editor = "Pardalos, {Panos M.} and Roberto Battiti and Mauro Brunato and Ilias Kotsireas",

booktitle = "Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers",

address = "Germany",

note = "12th International Conference on Learning and Intelligent Optimization, LION 12 ; Conference date: 10-06-2018 Through 15-06-2018",

}

Khachay, M & Neznakhina, K 2019, Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. in PM Pardalos, R Battiti, M Brunato & I Kotsireas (eds), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11353 LNCS, Springer Verlag, pp. 441-446, 12th International Conference on Learning and Intelligent Optimization, LION 12, Kalamata, Greece, 10/06/2018. https://doi.org/10.1007/978-3-030-05348-2_38

Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. / Khachay, Michael ; Neznakhina, Katherine.

Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. ed. / Panos M. Pardalos; Roberto Battiti; Mauro Brunato; Ilias Kotsireas. Springer Verlag, 2019. p. 441-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11353 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters

AU - Khachay, Michael

AU - Neznakhina, Katherine

PY - 2019/1/1

Y1 - 2019/1/1

KW - Generalized traveling salesman problem

KW - Polynomial time solvability

KW - Pseudo-pyramidal tour

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

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

U2 - 10.1007/978-3-030-05348-2_38

DO - 10.1007/978-3-030-05348-2_38

M3 - Conference contribution

AN - SCOPUS:85059954882

SN - 9783030053475

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

SP - 441

EP - 446

BT - Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers

A2 - Pardalos, Panos M.

A2 - Battiti, Roberto

A2 - Brunato, Mauro

A2 - Kotsireas, Ilias

PB - Springer Verlag

T2 - 12th International Conference on Learning and Intelligent Optimization, LION 12

Y2 - 10 June 2018 through 15 June 2018

ER -

Khachay M , Neznakhina K. Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. In Pardalos PM, Battiti R, Brunato M, Kotsireas I, editors, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer Verlag. 2019. p. 441-446. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-05348-2_38

Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters

Publication series

Conference

Keywords

ASJC Scopus subject areas

WoS ResearchAreas Categories

Access to Document

Научная лаборатория «Лаборатория оптимального раскроя промышленных материалов и оптимальных маршрутных технологий»

Cite this