Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow. (Q2756443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow. |
scientific article; zbMATH DE number 1673006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow. |
scientific article; zbMATH DE number 1673006 |
Statements
12 November 2001
0 references
Synthesis of a transportation network with a minimum number of edges, given an upper bound on the flow. (English)
0 references
