A tabu search algorithm for application placement in computer clustering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
- Algorithms for the variable sized bin packing problem
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Cloud computing. Principles, systems and applications
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Handbook of metaheuristics
- Improving Discrete Model Representations via Symmetry Considerations
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
Cited in
(3)- A \(k\)-means clustering-tabu search algorithm for collaborative logistics network resource demands design and cost analysis
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Application placement and backup service in computer clustering in software as a service (SaaS) networks
This page was built for publication: A tabu search algorithm for application placement in computer clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337070)