Core group placement: allocation and provisioning of heterogeneous resources
From MaRDI portal
Publication:2294073
Recommendations
- Dynamic packing with side constraints for datacenter resource management
- Optimal energy-efficient placement of virtual machines with divisible sizes
- Coupled and k-Sided Placements: Generalizing Generalized Assignment
- New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm
- Coupled and \(k\)-sided placements: generalizing generalized assignment
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A language and a program for stating and solving combinatorial problems
- Branch-and-Bound Methods: General Formulation and Properties
- Complete bound consistency for the global cardinality constraint
- Network flows. Theory, algorithms, and applications.
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles of Constraint Programming
This page was built for publication: Core group placement: allocation and provisioning of heterogeneous resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294073)