CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL (Q4337491)
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: CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL |
scientific article; zbMATH DE number 1011236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL |
scientific article; zbMATH DE number 1011236 |
Statements
CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL (English)
0 references
19 May 1997
0 references
performance analysis
0 references
polynomial algorithm
0 references
network capacity expansion
0 references
shortest path
0 references
constraint
0 references
design of communication networks
0 references
0.87589025
0 references
0.87407565
0 references
0.8675864
0 references
0.8674464
0 references
0.8672567
0 references
