Genetic local search and hardness of approximation for the server load balancing problem

DOI10.1134/S0005117917030043zbMath1368.93414OpenAlexW2594210837MaRDI QIDQ2399467

Aleksandr V. Plyasunov, Yury A. Kochetov, A. A. Panin

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/s0005117917030043

zbMATH Keywords

approximationlocal searchgenetic algorithmload balancing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Control/observation systems involving computers (process control, etc.) (93C83) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bilevel competitive facility location and pricing problems
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
• A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines
• Completeness in approximation classes beyond APX
• Genetic local search the graph partitioning problem under cardinality constraints
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• Structure in Approximation Classes
• Local search with an exponential neighborhood for the servers load balancing problem

This page was built for publication: Genetic local search and hardness of approximation for the server load balancing problem