The Chinese deliveryman problem
DOI10.1007/S10288-019-00420-2zbMATH Open1468.90116OpenAlexW2981260297WikidataQ126992817 ScholiaQ126992817MaRDI QIDQ2025136FDOQ2025136
Authors: Martijn van Ee, René A. Sitters 
Publication date: 11 May 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00420-2
Recommendations
computational complexityapproximation algorithmsChinese postman problemgraph searchChinese deliveryman problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Matching, Euler tours and the Chinese postman
- Proof verification and the hardness of approximation problems
- Probabilistic checking of proofs
- Some simplified NP-complete graph problems
- The Traveling Salesman Problem with Distances One and Two
- The minimum latency problem
- On the complexity of edge traversing
- Approximation Schemes for Minimum Latency Problems
- Title not available (Why is that?)
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
- The delivery man problem on a tree network
- Star search -- a different show
- Son of the linear search problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizations in the linear search problem
- Euler, Mei-ko Kwan, Königsberg, and a Chinese postman
- Asymmetric traveling salesman path and directed latency problems
Cited In (2)
This page was built for publication: The Chinese deliveryman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025136)
