Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01240734 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3138503030 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the number of minimum-mean cycle cancellations and related results |
scientific article |
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
