Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:06, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding |
scientific article |
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
