Upper and lower bounds for the two-level simple plant location problem (Q1290136): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:44, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for the two-level simple plant location problem |
scientific article |
Statements
Upper and lower bounds for the two-level simple plant location problem (English)
0 references
10 June 1999
0 references
two-level concentrator access network
0 references
simple plant location
0 references
linear programming relaxations
0 references
Lagrangian relaxation
0 references
lower bounds
0 references
simulated annealing
0 references
