Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method (Q2808637)
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: Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method |
scientific article; zbMATH DE number 6584318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method |
scientific article; zbMATH DE number 6584318 |
Statements
24 May 2016
0 references
optimal path design
0 references
GMPLS
0 references
Lagrangian relaxation
0 references
heuristic algorithm
0 references
simulation
0 references
lower bound
0 references
practical approximate solution
0 references
emergencies
0 references
0.8458493
0 references
0.84479874
0 references
0.83937895
0 references
0.83893573
0 references
0.8344774
0 references
0.8321038
0 references
Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method (English)
0 references
