Local search for load balancing problems for servers with large dimension

DOI10.1134/S0005117917030031zbMath1368.93412OpenAlexW2593239550MaRDI QIDQ2399466

Andrey Melnikov, I. A. Davydov, P. A. Kononova

Publication date: 23 August 2017

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117917030031

zbMATH Keywords

combinatorial optimizationstochastic local searchpacking problemsrandomized neighborhood

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Control/observation systems involving computers (process control, etc.) (93C83) Stochastic systems in control theory (general) (93E03)

Related Items (2)

Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

Cites Work

• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• Randomized local search for the discrete competitive facility location problem
• VNS-based heuristic with an exponential neighborhood for the server load balancing problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• The variable neighborhood search for the two machine flow shop problem with a passive prefetch
• Local search with an exponential neighborhood for the servers load balancing problem

This page was built for publication: Local search for load balancing problems for servers with large dimension