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 the normal view instead:
scientific article; zbMATH DE number 529940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8301882147789001
0 references
0.829591691493988
0 references
0.8090270161628723
0 references
0.8042044639587402
0 references
0.8042041063308716
0 references
