Current and future research directions in network optimization

This publication has 62 references indexed in Scilit:

• Complexity of network reliability computations
  Networks, 1980
• Computational Comparison of Eight Methods for the Maximum Network Flow Problem
  ACM Transactions on Mathematical Software, 1980
• On algorithms for finding the k shortest paths in a network
  Networks, 1979
• Interval estimation of a global optimum for large combinatorial problems
  Naval Research Logistics Quarterly, 1979
• Shortest paths with euclidean distances: An explanatory model
  Networks, 1978
• A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths
  Networks, 1978
• Iterative methods for determining the k shortest paths in a network
  Networks, 1976
• Networks and vehicle routing for municipal waste collection
  Networks, 1974
• Computing capacitated minimal spanning trees efficiently
  Networks, 1974
• Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities
  Journal of the Operational Research Society, 1971