Standard

Additive Routing Problem for a System of High-Priority Tasks: book chapter. / Chentsov, Alexandr; Chentsov, Pavel.
Mathematical Optimization Theory and Operations Research: Recent Trends: book. ред. / Michael Khachay; Yury Kochetov. Springer Cham, 2023. стр. 218-230 Chapter 17 (Communications in Computer and Information Science; Том 1881).

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

Harvard

Chentsov, A & Chentsov, P 2023, Additive Routing Problem for a System of High-Priority Tasks: book chapter. в M Khachay & Y Kochetov (ред.), Mathematical Optimization Theory and Operations Research: Recent Trends: book., Chapter 17, Communications in Computer and Information Science, Том. 1881, Springer Cham, стр. 218-230. https://doi.org/10.1007/978-3-031-43257-6_17

APA

Chentsov, A., & Chentsov, P. (2023). Additive Routing Problem for a System of High-Priority Tasks: book chapter. в M. Khachay, & Y. Kochetov (Ред.), Mathematical Optimization Theory and Operations Research: Recent Trends: book (стр. 218-230). [Chapter 17] (Communications in Computer and Information Science; Том 1881). Springer Cham. https://doi.org/10.1007/978-3-031-43257-6_17

Vancouver

Chentsov A, Chentsov P. Additive Routing Problem for a System of High-Priority Tasks: book chapter. в Khachay M, Kochetov Y, Редакторы, Mathematical Optimization Theory and Operations Research: Recent Trends: book. Springer Cham. 2023. стр. 218-230. Chapter 17. (Communications in Computer and Information Science). doi: 10.1007/978-3-031-43257-6_17

Author

Chentsov, Alexandr ; Chentsov, Pavel. / Additive Routing Problem for a System of High-Priority Tasks : book chapter. Mathematical Optimization Theory and Operations Research: Recent Trends: book. Редактор / Michael Khachay ; Yury Kochetov. Springer Cham, 2023. стр. 218-230 (Communications in Computer and Information Science).

BibTeX

@inproceedings{e3dfcce3585b463e8625da27dab17f91,
title = "Additive Routing Problem for a System of High-Priority Tasks: book chapter",
abstract = "It is considered the routing problem for which some fixed tasks must be serviced above all. Other tasks can be serviced only after realization of above-mentioned original tasks. It is supposed that each our task is the megalopolis (nonempty finite set) visiting with fulfilment of some works. In our setting, two partial interconnected routing problems arise. We suppose that, in each partial routing problem, the corresponding precedence conditions are given. Using widely understood dynamic programming (DP), we obtain the optimal composition solution for initial total problem. As an application, we note the known engineering problem connected with sheet cutting by zones on CNC machines. By DP procedure the optimal algorithm realized on PC was constructed.",
author = "Alexandr Chentsov and Pavel Chentsov",
year = "2023",
month = sep,
day = "21",
doi = "10.1007/978-3-031-43257-6_17",
language = "English",
isbn = "978-3-031-43256-9",
series = "Communications in Computer and Information Science",
publisher = "Springer Cham",
pages = "218--230",
editor = "Michael Khachay and Yury Kochetov",
booktitle = "Mathematical Optimization Theory and Operations Research: Recent Trends",
address = "United Kingdom",

}

RIS

TY - GEN

T1 - Additive Routing Problem for a System of High-Priority Tasks

T2 - book chapter

AU - Chentsov, Alexandr

AU - Chentsov, Pavel

PY - 2023/9/21

Y1 - 2023/9/21

N2 - It is considered the routing problem for which some fixed tasks must be serviced above all. Other tasks can be serviced only after realization of above-mentioned original tasks. It is supposed that each our task is the megalopolis (nonempty finite set) visiting with fulfilment of some works. In our setting, two partial interconnected routing problems arise. We suppose that, in each partial routing problem, the corresponding precedence conditions are given. Using widely understood dynamic programming (DP), we obtain the optimal composition solution for initial total problem. As an application, we note the known engineering problem connected with sheet cutting by zones on CNC machines. By DP procedure the optimal algorithm realized on PC was constructed.

AB - It is considered the routing problem for which some fixed tasks must be serviced above all. Other tasks can be serviced only after realization of above-mentioned original tasks. It is supposed that each our task is the megalopolis (nonempty finite set) visiting with fulfilment of some works. In our setting, two partial interconnected routing problems arise. We suppose that, in each partial routing problem, the corresponding precedence conditions are given. Using widely understood dynamic programming (DP), we obtain the optimal composition solution for initial total problem. As an application, we note the known engineering problem connected with sheet cutting by zones on CNC machines. By DP procedure the optimal algorithm realized on PC was constructed.

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

U2 - 10.1007/978-3-031-43257-6_17

DO - 10.1007/978-3-031-43257-6_17

M3 - Conference contribution

SN - 978-3-031-43256-9

T3 - Communications in Computer and Information Science

SP - 218

EP - 230

BT - Mathematical Optimization Theory and Operations Research: Recent Trends

A2 - Khachay, Michael

A2 - Kochetov, Yury

PB - Springer Cham

ER -

ID: 46904531