Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C90 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6389172 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
location theory | |||
| Property / zbMATH Keywords: location theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
network optimization | |||
| Property / zbMATH Keywords: network optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
integer programming | |||
| Property / zbMATH Keywords: integer programming / rank | |||
Normal rank | |||
Revision as of 22:34, 30 June 2023
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
