Local search with an exponential neighborhood for the servers load balancing problem

DOI10.1134/S1990478915010044zbMath1324.90070MaRDI QIDQ5264767

P. A. Kononova, I. A. Davydov, Yury A. Kochetov

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

local searchassignment problemload balancing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items

A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem ⋮ Local search for load balancing problems for servers with large dimension ⋮ Genetic local search and hardness of approximation for the server load balancing problem ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Randomized local search for the discrete competitive facility location problem
• A survey of very large-scale neighborhood search techniques
• Exponential neighbourhood local search for the traveling salesman problem
• Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
• Formulation space search approach for the teacher/class timetabling problem
• Multi-Start Methods
• Large neighborhood local search for the p-median problem
• The variable neighborhood search for the two machine flow shop problem with a passive prefetch
• Variable neighborhood search: Principles and applications