Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen
From MaRDI portal
Publication:1141591
DOI10.1007/BF02276757zbMath0437.90096MaRDI QIDQ1141591
Publication date: 1976
Published in: Computing (Search for Journal in Brave)
negative cycles; capacity matrix; gain matrix; maximal flows; antisymmetric network; capacitated networks with gains; edge gains; finite directed networks; graph-theoretic algorithm; path gains; shortest routes; weakly connected network
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Cites Work
- Unnamed Item
- Two new algorithms for minimal cost flow problems
- Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen
- ALGOL-Prozeduren für zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- Optimal Flow In A Network With Gains*