Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen (Q1141591): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ALGOL-Prozeduren für zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two new algorithms for minimal cost flow problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4106005 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Flow In A Network With Gains<sup>*</sup> / rank | |||
Normal rank | |||
Latest revision as of 05:27, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen |
scientific article |
Statements
Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen (English)
0 references
1976
0 references
finite directed networks
0 references
graph-theoretic algorithm
0 references
maximal flows
0 references
capacity matrix
0 references
shortest routes
0 references
negative cycles
0 references
antisymmetric network
0 references
weakly connected network
0 references
capacitated networks with gains
0 references
edge gains
0 references
path gains
0 references
gain matrix
0 references
