Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (Q3703812): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/net.3230150102 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000675190 / rank | |||
Normal rank |
Revision as of 00:43, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds |
scientific article |
Statements
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (English)
0 references
1985
0 references
computer communication network design
0 references
NP-complete
0 references
network layout
0 references
suboptimal solutions
0 references
lower bounds
0 references
approximation algorithm
0 references
concentrator capacity
0 references