Login / Signup

Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding.

Maciej DrwalJerzy Józefczyk
Published in: Ann. Oper. Res. (2014)
Keyphrases
  • data placement
  • lagrangian relaxation
  • linear programming
  • high availability
  • lower and upper bounds
  • np hard
  • integer programming
  • database
  • data mining
  • data structure
  • optimization problems