Finding minimum-cost circulations by canceling negative cycles (Q3474897): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56581179, #quickstatements; #temporary_batch_1706294994303 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:26, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum-cost circulations by canceling negative cycles |
scientific article |
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
