In the classical p-median problem, the objective is to find a set Y of p vertices on an undirected graph G=(V, E) G=(V, E) in such a way that Y ⊆ VY⊆ V and the sum of distances …
A Singh, J Banda - Applied Intelligence, 2017 - Springer
This paper presents hybrid artificial bee colony algorithm based approaches for two NP NP- hard problems arising in optical ring networks. These two problems falls under the category …
B Jayalakshmi, A Singh - International Journal of …, 2016 - inderscienceonline.com
p-median problem is a well-known facility location problem which aims at locating p number of facilities over n demand points in such a way that the sum of distances from all the …
B Jayalakshmi, A Singh - International Journal of Swarm …, 2018 - inderscienceonline.com
The p-centre problem is an important facility location problem. In this problem, the objective is to find a set Y of p vertices on an undirected weighted graph G=(V, E) in such a way that …