Genetic algorithm to solve the p-centre and p-radius problem on a network

DOI10.1080/00207160512331323380zbMath1068.90078OpenAlexW1966416998MaRDI QIDQ5460568

Madhumangal Pal, Sk. Md. Abu Nayeem

Publication date: 18 July 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160512331323380

zbMATH Keywords

networkgenetic algorithmfacility location problem\(p\)-centre problem

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (4)

Approximability results for the $p$-centdian and the converse centdian problems ⋮ Approximability results for the converse connectedp-centre problem^† ⋮ Genetic algorithmic approach to find the maximum weight independent set of a graph ⋮ Homogeneous genetic algorithms

This page was built for publication: Genetic algorithm to solve the p-centre and p-radius problem on a network