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

Michael Khachay, K. Neznakhina

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

4 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииAnalysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers
ИздательSpringer Verlag
Страницы346-355
Число страниц10
Том10716 LNCS
ISBN (печатное издание)9783319730127
DOI
СостояниеОпубликовано - 1 янв 2018
Событие6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017 - Moscow, Российская Федерация
Продолжительность: 27 июл 201729 июл 2017

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

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

Конференция

Конференция6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017
СтранаРоссийская Федерация
ГородMoscow
Период27/07/201729/07/2017

Отпечаток

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

Ключевые слова

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

    • Theoretical Computer Science
    • Computer Science(all)

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

    • Компьютерные науки, Информационные системы
    • Компьютерные науки, Теория и методы

    Цитировать

    Khachay, M., & Neznakhina, K. (2018). 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 (Том 10716 LNCS, стр. 346-355). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 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. Том 10716 LNCS Springer Verlag, 2018. стр. 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. в Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. том. 10716 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 10716 LNCS, Springer Verlag, стр. 346-355, 6th International Conference on Analysis of Images, Social Networks and Texts, AIST 2017, Moscow, Российская Федерация, 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. Том 10716 LNCS Springer Verlag, 2018. стр. 346-355 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10716 LNCS).

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

    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

    UR - https://elibrary.ru/item.asp?id=35492504

    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. В Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Том 10716 LNCS. Springer Verlag. 2018. стр. 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