Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen

DOI10.1007/BF02276757zbMath0437.90096MaRDI QIDQ1141591

Reiner Horst

Publication date: 1976

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

negative cyclescapacity matrixgain matrixmaximal flowsantisymmetric networkcapacitated networks with gainsedge gainsfinite directed networksgraph-theoretic algorithmpath gainsshortest routesweakly connected network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

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^*

This page was built for publication: Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen