Finding minimum-cost circulations by canceling negative cycles (Q3474897)
From MaRDI portal
!
WARNING
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 4143458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum-cost circulations by canceling negative cycles |
scientific article; zbMATH DE number 4143458 |
Statements
Finding minimum-cost circulations by canceling negative cycles (English)
0 references
1989
0 references
network problems
0 references
cycle cancelling
0 references
minimum-cost flow
0 references
network optimization
0 references
transportation problem
0 references
transshipment problem
0 references
dynamic trees
0 references
0.8887616395950317
0 references
0.8764828443527222
0 references
0.8764828443527222
0 references
0.8712992072105408
0 references
