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

DOI10.1134/S0005117917030043MaRDI QIDQ2399467zbMATH OpenOpenAlexFDO

Authors Yury Kochetov, A. V. Plyasunov, 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

approximationgenetic algorithmload balancinglocal search

Mathematics Subject Classification ID

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

Recommendations

• Local search for load balancing problems for servers with large dimension
• Local search with an exponential neighborhood for the servers load balancing problem
• Genetic local search for the p-median problem with client preferences
• Genetic local search for the graph partitioning problem under cardinality constraints
• A Distributed Hybrid Heuristics of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem
• Publication:4719761
• Genetic local search in combinatorial optimization

Cites work

• A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines
• Bilevel competitive facility location and pricing problems
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem
• Completeness in approximation classes beyond APX
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
• Genetic local search for the p-median problem with client preferences
• Genetic local search for the graph partitioning problem under cardinality constraints
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 2077131 (Why is no real title available?)
• Local search with an exponential neighborhood for the servers load balancing problem
• Metaheuristics. From design to implementation.
• Structure in Approximation Classes

Cited in

(4)

• Local search for load balancing problems for servers with large dimension
• 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
• An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399467)