The Chinese deliveryman problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1303538 (Why is no real title available?)
- scientific article; zbMATH DE number 2086925 (Why is no real title available?)
- scientific article; zbMATH DE number 2102754 (Why is no real title available?)
- Approximation Schemes for Minimum Latency Problems
- Asymmetric traveling salesman path and directed latency problems
- Euler, Mei-ko Kwan, Königsberg, and a Chinese postman
- Generalizations in the linear search problem
- Matching, Euler tours and the Chinese postman
- On the complexity of edge traversing
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Some simplified NP-complete graph problems
- Son of the linear search problem
- Star search -- a different show
- The Traveling Salesman Problem with Distances One and Two
- The delivery man problem on a tree network
- The minimum latency problem
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)