Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (Q2757624)
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: Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow |
scientific article; zbMATH DE number 1677121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow |
scientific article; zbMATH DE number 1677121 |
Statements
26 November 2001
0 references
minimum cost flow
0 references
scaling
0 references
relaxed optimality
0 references
cycle canceling
0 references
cut canceling
0 references
Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (English)
0 references
