Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126594400, #quickstatements; #temporary_batch_1719314627150 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126594400 / rank | |||
Normal rank | |||
Revision as of 13:25, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle |
scientific article |
Statements
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (English)
0 references
5 May 2021
0 references
minimum cost flow problem
0 references
(dynamic) multicommodity
0 references
combinatorial optimization
0 references
decomposition principle
0 references
