scholarly journals SOME CONSIDERATIONS ABOUT THE OPTIMAL NETWORK PROBLEM

1976 ◽  
Vol 1976 (250) ◽  
pp. 85-97 ◽  
Author(s):  
Takashi NISHIMURA ◽  
Yasuo HINO
Keyword(s):  
Network Problem ◽  
Optimal Network

Solving the optimal network problem

1979 ◽  
Vol 3 (5) ◽  
pp. 386-393 ◽  
Author(s):  
T.B. Boffey ◽  
A.I. Hinxman
Keyword(s):  
Network Problem ◽  
Optimal Network

Optimal Network Problem: A Branch-and-Bound Algorithm

1973 ◽  
Vol 5 (4) ◽  
pp. 519-533 ◽  
Author(s):  
D E Boyce ◽  
A Farhi ◽  
R Weischedel
Keyword(s):  
Variable Selection ◽  
Branch And Bound ◽  
Shortest Path ◽  
Budget Constraint ◽  
Computational Experience ◽  
Branch And Bound Algorithm ◽  
Selection Problems ◽  
Network Problem ◽  
Optimal Network ◽  
Modified Algorithm

The problem of selecting a subset of links so as to minimize the sum of shortest path distances between all pairs of nodes, subject to a budget constraint on total length of links, may be solved by a modification of a branch-and-bound algorithm developed for optimal variable selection problems in statistics. The modified algorithm is described in detail, and encouraging computational experience on 10 node networks is reported. The use of the algorithm as a heuristic approach to solving the optimal network problem is also discussed.

Sign in / Sign up

Export Citation Format

Share Document