Using matrix approximation for high-dimensional discrete optimization problems: Server consolidation based on cyclic time-series data
- 29 December 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 227 (1) , 62-75
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Adaptive threshold-based approach for energy-efficient consolidation of virtual machines in cloud data centers2010
- Energy-Aware Autonomic Resource Allocation in Multitier Virtualized EnvironmentsIEEE Transactions on Services Computing, 2010
- Short-term performance management by priority-based queueingService Oriented Computing and Applications, 2010
- TS2PACK: A two-level tabu search for the three-dimensional bin packing problemEuropean Journal of Operational Research, 2009
- Improved approximation algorithms for multidimensional bin packing problems2006
- Fast monte-carlo algorithms for finding low-rank approximationsJournal of the ACM, 2004
- Allocation of bandwidth and storageIIE Transactions, 2002
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- A principal axis transformation for non-hermitian matricesBulletin of the American Mathematical Society, 1939