Algorithm modification of the level-by-level approximation to the minimum route

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

Язык оригиналаАнглийский
Название основной публикации2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017
ИздательInstitute of Electrical and Electronics Engineers Inc.
Страницы270-275
Число страниц6
ISBN (электронное издание)9781538646625
DOI
СостояниеОпубликовано - 18 июн 2018
Событие17th IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017 - Bilbao, Испания
Продолжительность: 17 дек 201719 дек 2017

Конференция

Конференция17th IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017
СтранаИспания
ГородBilbao
Период17/12/201719/12/2017

Отпечаток

Traveling salesman problem
Testing

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

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

    • Safety, Risk, Reliability and Quality
    • Energy Engineering and Power Technology
    • Computer Networks and Communications
    • Computer Vision and Pattern Recognition
    • Hardware and Architecture
    • Signal Processing

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

    • Технологии, Электро и электронные
    • Телекоммуникации

    Цитировать

    Starostin, N. D., & Mironov, K. V. (2018). Algorithm modification of the level-by-level approximation to the minimum route. В 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017 (стр. 270-275). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISSPIT.2017.8388654
    Starostin, N. D. ; Mironov, K. V. / Algorithm modification of the level-by-level approximation to the minimum route. 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. Institute of Electrical and Electronics Engineers Inc., 2018. стр. 270-275
    @inproceedings{7d76924fb2804d2eb3148cfc4b69714e,
    title = "Algorithm modification of the level-by-level approximation to the minimum route",
    keywords = "CNC, minimum route, optimization, traveling salesman problem, TSP",
    author = "Starostin, {N. D.} and Mironov, {K. V.}",
    year = "2018",
    month = "6",
    day = "18",
    doi = "10.1109/ISSPIT.2017.8388654",
    language = "English",
    pages = "270--275",
    booktitle = "2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    Starostin, ND & Mironov, KV 2018, Algorithm modification of the level-by-level approximation to the minimum route. в 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. Institute of Electrical and Electronics Engineers Inc., стр. 270-275, 17th IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017, Bilbao, Испания, 17/12/2017. https://doi.org/10.1109/ISSPIT.2017.8388654

    Algorithm modification of the level-by-level approximation to the minimum route. / Starostin, N. D.; Mironov, K. V.

    2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. Institute of Electrical and Electronics Engineers Inc., 2018. стр. 270-275.

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

    TY - GEN

    T1 - Algorithm modification of the level-by-level approximation to the minimum route

    AU - Starostin, N. D.

    AU - Mironov, K. V.

    PY - 2018/6/18

    Y1 - 2018/6/18

    KW - CNC

    KW - minimum route

    KW - optimization

    KW - traveling salesman problem

    KW - TSP

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

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

    U2 - 10.1109/ISSPIT.2017.8388654

    DO - 10.1109/ISSPIT.2017.8388654

    M3 - Conference contribution

    SP - 270

    EP - 275

    BT - 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Starostin ND, Mironov KV. Algorithm modification of the level-by-level approximation to the minimum route. В 2017 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2017. Institute of Electrical and Electronics Engineers Inc. 2018. стр. 270-275 https://doi.org/10.1109/ISSPIT.2017.8388654