Networks · 1974 · 49 citations · 9 references
ComputingComputer ScienceCapacity PlanningComputer NetworksOptimizationCombinatorial OptimizationCommunication NetworksCost MinimizationNetwork Capacity PlanningNetwork Flow AlgorithmsNetwork OptimizationCapacitated Network DesignCapacity DimensioningDynamic Network OptimizationNetwork CapacityNetwork Capacity AllocationNetwork Cost FunctionsNetwork Cost OptimizationNetwork Design Problems
Abstract This paper deals with the problem of minimizing the present worth of expenditures needed to enlarge the capacity of a communications network over time so as to meet rising traffic demands. Eight general “tests” are given for improving network solutions. The tests require only a moderate amount of computation and have the property that they will improve a wide class of non‐optimal solutions. It is observed that for a large subclass of practical problems, the dynamic problem of building a network over time may be converted to a static problem for most of the computations. This suggests a strong similarity between the optimal solutions to both problems.
9
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations
Integer Programming and Network Flows.
S. Vajda · Journal of the Operational Research Society · 1970 · 696 citations
Minimum-Cost Multicommodity Network Flows
John A. Tomlin · Operations Research · 1966 · 178 citations
Minimum cost routing for static network models
B. Yaged · Networks · 1971 · 174 citations
Natural Sciences, Infrastructure Planning, Operations Management +17