The problem of maximum flow with minimum attainable cost in a network (Q505156)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of maximum flow with minimum attainable cost in a network |
scientific article; zbMATH DE number 6676251
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The problem of maximum flow with minimum attainable cost in a network |
scientific article; zbMATH DE number 6676251 |
Statements
The problem of maximum flow with minimum attainable cost in a network (English)
0 references
19 January 2017
0 references
distance and capacity matrix
0 references
lexicographic search approach and algorithm
0 references
0 references
