A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585)
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: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 1626204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 1626204 |
Statements
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (English)
0 references
2001
0 references
Design of centralized networks
0 references
Quality of service constraints
0 references
Hop constraints
0 references
Lagrangean relaxation
0 references
Multicommodity flows
0 references
minimum spanning tree
0 references
centralized telecommunication networks
0 references
linear programming relaxation
0 references
0 references
0 references
0 references
