A solvable routing problem
β
E. N. Gilbert
π
Article
π
1989
π
John Wiley and Sons
π
English
β 337 KB
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