Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475)
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: Tight bounds on the number of minimum-mean cycle cancellations and related results |
scientific article; zbMATH DE number 529940
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the number of minimum-mean cycle cancellations and related results |
scientific article; zbMATH DE number 529940 |
Statements
Tight bounds on the number of minimum-mean cycle cancellations and related results (English)
0 references
11 September 1994
0 references
network flow problem
0 references
minimum cost flow
0 references
minimum cost circulation
0 references
combinatorial optimization
0 references
cycle cancelling algorithms
0 references
strongly polynomial algorithms
0 references
minimum-mean cycle-cancelling algorithm
0 references
maximum- mean cut canceling algorithm
0 references
dual algorithm
0 references
0 references
0 references
