Diagnosing infeasibilities in network flow problems (Q1290604)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1294660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diagnosing infeasibilities in network flow problems |
scientific article; zbMATH DE number 1294660 |
Statements
Diagnosing infeasibilities in network flow problems (English)
0 references
5 September 1999
0 references
network flows
0 references
preflow-push algorithm
0 references
witness of infeasibility
0 references
feasible flow in a directed network
0 references
feasibility problem
0 references
maximum flow
0 references
minimum rooted cut problem
0 references
0 references
0.8339120745658875
0 references
0.8114132881164551
0 references
0.8040916919708252
0 references
0.7958752512931824
0 references
0.7881402969360352
0 references
