Genetic local search for the p-median problem with client preferences

MaRDI QIDQ3115656zbMATH OpenFDO

Authors E. V. Alekseeva, Yury Kochetov

Publication date 10 February 2012

zbMATH Keywords

global optimizationgenetic algorithmlocation problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• An efficient genetic algorithm for the \(p\)-median problem
• scientific article; zbMATH DE number 1803759
• Variable neighborhood search for the p-median
• A genetic algorithm for solving a capacitated \(p\)-median problem
• New heuristic algorithms for solving the planar p-median problem

Cited in

(4)

• Discrete facility location in machine learning
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
• Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems
• Genetic local search and hardness of approximation for the server load balancing problem

This page was built for publication: Genetic local search for the \(p\)-median problem with client preferences

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