The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable Научная публикация
Журнал |
Operations Research Letters
ISSN: 0167-6377 |
||||
---|---|---|---|---|---|
Вых. Данные | Год: 2021, Том: 49, Номер: 2, Страницы: 270-277 Страниц : 8 DOI: 10.1016/j.orl.2021.01.017 | ||||
Ключевые слова | Approximation algorithm; Arc routing; Fixed-parameter algorithm; NP-hardness; Rural Postman Problem; Temporal graphs | ||||
Авторы |
|
||||
Организации |
|
Библиографическая ссылка:
Afanasev V.A.
, van Bevern R.
, Tsidulko O.Y.
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable
Operations Research Letters. 2021. V.49. N2. P.270-277. DOI: 10.1016/j.orl.2021.01.017 WOS Scopus OpenAlex
The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable
Operations Research Letters. 2021. V.49. N2. P.270-277. DOI: 10.1016/j.orl.2021.01.017 WOS Scopus OpenAlex
Идентификаторы БД:
Web of science: | WOS:000624944700022 |
Scopus: | 2-s2.0-85100767856 |
OpenAlex: | W3128828969 |