Canceling most helpful total cuts for minimum cost network flow (Q5285477)
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 222351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Canceling most helpful total cuts for minimum cost network flow |
scientific article; zbMATH DE number 222351 |
Statements
Canceling most helpful total cuts for minimum cost network flow (English)
0 references
29 June 1993
0 references
most helpful total cut cancelling
0 references
polynomial algorithm
0 references
minimum cost network flow
0 references
0 references
0 references
0.8695303
0 references
0.8585527
0 references
0.8557589
0 references
0.85530293
0 references
0 references
0.8528589
0 references
