Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-013-1330-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-013-1330-7 / rank | |||
Normal rank | |||
Latest revision as of 19:10, 9 December 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
0 references
0 references
0 references
