Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(92)90048-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065932050 / rank | |||
Normal rank | |||
Revision as of 01:35, 20 March 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
