Finding minimum-cost circulations by canceling negative cycles (Q3474897): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jacm/GoldbergT89, #quickstatements; #temporary_batch_1731468600454 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/76359.76368 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048790997 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/GoldbergT89 / rank | |||
Normal rank | |||
Latest revision as of 05:10, 13 November 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
