The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
From MaRDI portal
Publication:6353246
DOI10.1016/J.ORL.2021.01.017zbMath1525.90410arXiv2011.04022MaRDI QIDQ6353246
O. Yu. Tsidulko, Vsevolod A. Afanasev, René van Bevern
Publication date: 8 November 2020
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
This page was built for publication: The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
