Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221)
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: Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding |
scientific article; zbMATH DE number 6389172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding |
scientific article; zbMATH DE number 6389172 |
Statements
Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (English)
0 references
22 January 2015
0 references
location theory
0 references
network optimization
0 references
integer programming
0 references
0 references
0 references
0 references
0 references
0.7787168025970459
0 references
0.7765311002731323
0 references
0.7754403352737427
0 references
