Publication:3922498
From MaRDI portal
zbMath0468.90077MaRDI QIDQ3922498
Publication date: 1980
feasibility; ordered semigroup; algebraic flows in networks; antisymmetrical graph; max algebraic flow problem; maximal flow-minimal cut theorem
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
90C48: Programming in abstract spaces
06F05: Ordered semigroups and monoids
20M99: Semigroups
Related Items
Algebraic flows in regular matroids, Optimal cocircuits in regular matroids and applications, Characterizations of max-balanced flows, Max-balanced flows in oriented matroids, An analogue of Hoffman's circulation conditions for max-balanced flows