On general routing problems: Comments
β Scribed by C. S. Orloff
- Publisher
- John Wiley and Sons
- Year
- 1976
- Tongue
- English
- Weight
- 190 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The mesh of buses MBUSs is a parallel computation model which consists of n = n processors, n row buses, and n column buses, but no local connections between neighboring processors. An n lower bound for the permutation routing on this model is shown. The proof does not depend on common predetermined
## Abstract Arc routing problems are vehicle routing problems in which the tasks to be performed are located on some arcs or edges of a network, e.g., spreading salt on a road or collecting municipal refuse in a street. They have been much less studied than node routing problems but impressive deve