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

Результат исследований: Глава в книге, отчете, сборнике статей › Материалы конференции

Язык оригинала	Английский
Название основной публикации	Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers
Редакторы	Panos M. Pardalos, Roberto Battiti, Mauro Brunato, Ilias Kotsireas
Издатель	Springer Verlag
Страницы	441-446
Число страниц	6
ISBN (печатное издание)	9783030053475
DOI	https://doi.org/10.1007/978-3-030-05348-2_38
Состояние	Опубликовано - 1 янв 2019
Событие	12th International Conference on Learning and Intelligent Optimization, LION 12 - Kalamata, Греция Продолжительность: 10 июн 2018 → 15 июн 2018

Серия публикаций

Название	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том	11353 LNCS
ISSN (печатное издание)	0302-9743
ISSN (электронное издание)	1611-3349

Конференция

Конференция	12th International Conference on Learning and Intelligent Optimization, LION 12
Страна	Греция
Город	Kalamata
Период	10/06/2018 → 15/06/2018

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

Theoretical Computer Science
Computer Science(all)

Ссылки

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

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters». Вместе они формируют уникальный семантический отпечаток (fingerprint).

1 Активно

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

Цитировать

Khachay, M., & Neznakhina, K. (2019). Pseudo-pyramidal tours and efficient solvability of the euclidean generalized traveling salesman problem in grid clusters. В P. M. Pardalos, R. Battiti, M. Brunato, & I. Kotsireas (Ред.), Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers (стр. 441-446). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 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. редактор / Panos M. Pardalos ; Roberto Battiti ; Mauro Brunato ; Ilias Kotsireas. Springer Verlag, 2019. стр. 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. в PM Pardalos, R Battiti, M Brunato & I Kotsireas (ред.), 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), том. 11353 LNCS, Springer Verlag, стр. 441-446, 12th International Conference on Learning and Intelligent Optimization, LION 12, Kalamata, Греция, 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. ред. / Panos M. Pardalos; Roberto Battiti; Mauro Brunato; Ilias Kotsireas. Springer Verlag, 2019. стр. 441-446 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11353 LNCS).

Результат исследований: Глава в книге, отчете, сборнике статей › Материалы конференции

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

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. В Pardalos PM, Battiti R, Brunato M, Kotsireas I, редакторы, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer Verlag. 2019. стр. 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

Серия публикаций

Конференция

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

Ссылки

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

Цитировать