Local search for load balancing problems for servers with large dimension
From MaRDI portal
Publication:2399466
Recommendations
- Local search with an exponential neighborhood for the servers load balancing problem
- Offline file assignments for online load balancing
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
- Genetic local search and hardness of approximation for the server load balancing problem
- Performance of global load balancing by local adjustment
Cites work
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- An Efficient Heuristic Procedure for Partitioning Graphs
- Local search with an exponential neighborhood for the servers load balancing problem
- Randomized local search for the discrete competitive facility location problem
- The variable neighborhood search for the two machine flow shop problem with a passive prefetch
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
Cited in
(7)- Locally optimal load balancing
- Genetic local search and hardness of approximation for the server load balancing problem
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
- Bilevel `defender-attacker' model with multiple attack scenarios
- A local search algorithm for the single machine scheduling problem with setups and a storage
- Local search with an exponential neighborhood for the servers load balancing problem
- Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
This page was built for publication: Local search for load balancing problems for servers with large dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399466)