AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT (Q4444094)
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: AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT |
scientific article; zbMATH DE number 2028809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT |
scientific article; zbMATH DE number 2028809 |
Statements
AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT (English)
0 references
2003
0 references
mixed integer programming problem
0 references
heuristic algorithm
0 references
large-scale networks
0 references
0.8122034072875977
0 references
0.7977871298789978
0 references
0.7810893654823303
0 references
0.7809767127037048
0 references
0.7778872847557068
0 references
