Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795)
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 95797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the minimum cost circulation problem based on maximizing the mean improvement |
scientific article; zbMATH DE number 95797 |
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
0 references
0 references
0.8579132556915283
0 references
0.8396440148353577
0 references
0.8245537877082825
0 references
