New Directions in Network Flows

本研究旨在开发和分析有效的算法 解决各种标准网络流问题。 的算法 应从经验和理论两个角度进行分析 风景 用于评估算法的比较措施是 最坏情况性能、平均情况性能和经验 基于计算实验的性能。 都是连续的 并行算法的实现也有待研究。 一 要使用的主要工具是缩放，解决一系列 越来越接近原始问题的问题， 前一个问题的解的重新优化用于 解决下一个问题。 影响当前最新技术水平的重要新成果 网络流理论的知识和完善的技术基础 在这项研究中应该是成功的。

This research is to develop and analyze efficient algorithms for a variety of standard network flow problems. The algorithms are to be analyzed from both empirical and theoretical points of view. Comparison measures used to evaluate the algorithms are worst case performance, average case performance and empirical performance based on computational experiments. Both sequential and parallel algorithm implementation is to be investigated. One of the major tools to be used is scaling, solving a sequence of problems that are closer and closer to the original problem and reoptimization of the solution of the previous problem is used to solve the next problem. Important new results to impact the current state-of-the-art knowledge and improve the technology base in network flow theory should prove successful in this research.