A decomposition algorithm to determine the maximum flow in a generalized network (Q1121762): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(89)90017-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161863826 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow with Gains through a Special Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Calculating Maximal Flows in a Network with Positive Gains / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving Generalized Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3734141 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4171828 / rank | |||
Normal rank | |||
Latest revision as of 15:40, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition algorithm to determine the maximum flow in a generalized network |
scientific article |
Statements
A decomposition algorithm to determine the maximum flow in a generalized network (English)
0 references
1989
0 references
decomposition
0 references
Generalized networks
0 references
positive arc multipliers
0 references
subnetworks
0 references
