Optimal Network Problem: A Branch-and-Bound Algorithm
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
Branch-and-Bound Methods: A Survey
1966 • 1,915 citations
Journal of transport economics and policy
1969 • 1,440 citations
An Algorithm for the Traveling Salesman Problem
1963 • 1,029 citations
The Traveling Salesman Problem: A Survey
1968 • 389 citations
Integer and Nonlinear Programming
1971 • 268 citations
Programming, Games and Transportation Networks.
1967 • 237 citations
The discarding of variables in multivariate analysis
1967 • 230 citations
Optimization of transport networks
1975 • 129 citations
Optimum Seeking with Branch and Bound
1966 • 111 citations
The optimal network problem: Some computational procedures
1969 • 63 citations
An investment policy to reduce the travel time in a transportation network
1968 • 39 citations
The role of topology and geometry in optimal network design
1968 • 19 citations
The Method of Competing Links
1970 • 14 citations
A programming model of an integrated transportation network
1967 • 10 citations
Optimal Transportation Networks: A Case Study of Highway Systems
1970 • 10 citations
A REVIEW OF THE COMPUTATIONAL PROBLEMS OF SELECTING AN OPTIMAL TRAFFIC NETWORK.
1967 • 4 citations
AN ALGORITHM FOR SYNTHESIZING OPTIMAL TRANSPORTATION NETWORKS
1971 • 2 citations