The period routing problem
β Scribed by N. Christofides; J. E. Beasley
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 726 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Stations 1,2, . . . ,n are interconnected; b,, channels join stations i and j . Channels may be grouped together in cables to reduce cost. A routing problem requires a channel layout (or network of cables) that has minimum cost. The cost of a cable is taken to be independent of its length but a func
## Abstract Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer's usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meterβreading routes. On the other hand,