The maximum capacity path problem is to find a path from a source to a sink which has the maximum capacity among all paths. This paper addresses an extension of this problem which considers loss factors. It is called the generalized maximum capacity path problem. The problem is a network flow optimization problem whose network contains capacities as well as loss factors for arcs. The aim of the problem is to find a path from an origin to a destination so as to send a maximum flow along the path considering loss factors and respecting capacity constraints. The paper presents a zero-one formulation of the problem and moreover, it presents two efficient algorithms which solve the problem in polynomial time.

翻译：最大容量路径问题旨在寻找从源点到汇点的一条路径，该路径在所有路径中具有最大容量。本文探讨了该问题的一个扩展形式，其中考虑了损耗因子，称为广义最大容量路径问题。该问题是一个网络流优化问题，其网络中的弧段同时具有容量和损耗因子。问题的目标是在考虑损耗因子并满足容量约束的前提下，找到一条从起点到终点的路径，以便沿该路径发送最大流量。本文给出了该问题的0-1规划形式，并进一步提出了两种能够在多项式时间内求解该问题的高效算法。