Lower planes for the network design problem

This publication has 11 references indexed in Scilit:

• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
  IEEE Transactions on Automatic Control, 1982
• A new algorithm to find the shortest paths between all pairs of nodes
  Discrete Applied Mathematics, 1982
• A dual simplex algorithm for finding all shortest paths
  Networks, 1981
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
  Operations Research, 1981
• Quadratic knapsack problems
  Published by Springer Nature ,1980
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
  Networks, 1979
• Exact and approximate algorithms for optimal network design
  Networks, 1979
• The complexity of the network design problem
  Networks, 1978
• Optimal Network Problem: A Branch-and-Bound Algorithm
  Environment and Planning A: Economy and Space, 1973
• A Computational Approach to the Selection of an Optimal Network
  Management Science, 1973