可行流

最大可行流问题中增值链的一种回溯求解算法

The Retrospective Algorithm about Searching Augmenting Path of Maximum Feasible Flow Problem

网络规划法具有运算简便、快速、收敛可靠的特点，而OKA又能处理非零下界约束和不可行流的情况，特别适于解算具有安全约束的有功再调度问题。

The network flow programming is characterized by simple manipulation , fast and reliable convergence , while the OKA can treat nonzero lower bounds and may initiate with any set of flows ( including infeasible flow ) which satisfies Conservation of flow .

城市公路网络系统最佳可行流及其可靠性

Furthest-Flow with Reliability of City-Roda Network System

一个利润可行流可分解为若干个路流和圈流，相应地该可行流的利润也等于这些路流和圈流的利润之和。

A feasible MPF can be decomposed into a few path flows and a few circle flows , and consequently the profit of MPF is divided into the profit of those path flows and circle flows .