Upper and lower bounds for the two-level simple plant location problem (Q1290136)
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: Upper and lower bounds for the two-level simple plant location problem |
scientific article; zbMATH DE number 1299343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounds for the two-level simple plant location problem |
scientific article; zbMATH DE number 1299343 |
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
0 references
0.89313066
0 references
0.89304215
0 references
0.8922094
0 references
0.8837603
0 references
0.8835804
0 references
0.88356024
0 references
0.8833706
0 references
