On building minimum cost communication networks over time

This publication has 9 references indexed in Scilit:

• A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
  SIAM Journal on Computing, 1973
• Minimum cost routing for dynamic network models
  Networks, 1973
• On building minimum cost communication networks
  Networks, 1973
• Minimum cost routing for static network models
  Networks, 1971
• The Traveling-Salesman Problem and Minimum Spanning Trees
  Operations Research, 1970
• Note—A Note on the Cyclic Coordinate Ascent Method
  Management Science, 1970
• Minimum-Cost Multicommodity Network Flows
  Operations Research, 1966
• Flows in Networks
  Published by Walter de Gruyter GmbH ,1963
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959