Extreme points and adjacency relationship in the flow polytope
Extreme points and adjacency relationship in the flow polytope
复制标题
流多面体中的极值点和邻接关系
作者：
G. Gallo;C. Sodini
极值流是网络流问题可行集的极值点，在大多数优化问题中起着基础性的作用。本文研究了极端流之间的非相干关系，并给出了一个定理，即对于给定网络上的任何极端流，其相邻极端流的集合与一个圈的集合之间存在一一对应关系。
Extreme flows, that is extreme points of the feasible set for network flow problems, play a fundamental role in most optimization problems. The adiacency relation between extreme flows is investigated, and a theorem is stated, which, for any extreme flow on a given network, defines a one-to-one correspondence between the set of its neighboring extreme flows and a set of cycles.