A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(00)00143-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052035035 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
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
