The Hierarchical Chinese Postman Problem : the slightest disorder makes it hard, yet disconnectedness is manageable
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
| Year of publication: |
2021
|
|---|---|
| Authors: | Afanasev, Vsevolod A. ; Van Bevern, René ; Tsidulko, Oxana |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 2, p. 270-277
|
| Subject: | Approximation algorithm | Arc routing | Fixed-parameter algorithm | NP-hardness | Rural Postman Problem | Temporal graphs | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Graphentheorie | Graph theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.orl.2021.01.017 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012506670