Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-013-1330-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988722832 / rank | |||
Normal rank | |||
Revision as of 21:03, 19 March 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
