Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (Q3703812): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:55, 5 February 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
