1 网络流规划 网络流规划(network flow programming ,NFP) 是针 对网络问题的一类特殊算法,其最大优点是一切与 水流有关的约束都可以用网络流来表达 [13] ...
基于12个网页-相关网页
This paper presents a new approach to study the automatic contingency selection and ranking using the network flow programming.
本文用网络规划法对预想事故进行自动选择和排序。
A new approach of the automatic contingency selection and ranking with the network flow programming (NFP) is presented in this paper.
本文提出用网络规划法对预想事故进行自动选择和排序。
This paper describes the relation between the transportation problem and the network flow programming, and discusses the importance of developing a transportation network system.
本文叙述了运输问题与网络规划之间的关系以及开发运输网络系统的重要意义，并给出了运输问题的数学模型。
应用推荐