scientific article
From MaRDI portal
Publication:3922498
zbMath0468.90077MaRDI QIDQ3922498
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
feasibilityordered semigroupalgebraic flows in networksantisymmetrical graphmax algebraic flow problemmaximal flow-minimal cut theorem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48) Ordered semigroups and monoids (06F05) Semigroups (20M99)
Related Items
Max-balanced flows in oriented matroids ⋮ Algebraic flows in regular matroids ⋮ Optimal cocircuits in regular matroids and applications ⋮ Characterizations of max-balanced flows ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows