Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:01, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the minimum cost circulation problem based on maximizing the mean improvement |
scientific article |
Statements
Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (English)
0 references
16 January 1993
0 references
network flow
0 references
dual algorithm
0 references
polynomial algorithms
0 references
minimum cost circulation problem
0 references
