An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

By Alok Singh. Applied Soft Computing, 2009

449 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A survey on new generation metaheuristic algorithms (2019, methodology): “Singh (2009) proposes an ABC method for the solution of minimum spanning tree problem with leaf-constrains.”
A Comprehensive Review of Swarm Optimization Algorithms (2015, methodology): “It can be used in many optimization problems without any modification, and it requires fewer control parameters compared with other search techniques [77 – 80].”
An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, methodology): “However, ABC has been applied to solve other problems with great success (Baykaso ğ ly et al., 2007; Kang et al., 2009; Karaboga, 2009; Karaboga and Basturk, 2007, 2008; Karaboga and Ozturk, 2009; Singh, 2009).”
Gbest-guided artificial bee colony algorithm for numerical function optimization (2010, methodology): “In [13], Singh applied ABC algorithm for the Leaf-Constrained Minimum Spanning Tree (LCMST) problem.”
A comparative study of Artificial Bee Colony algorithm (2009, methodology): “ABC algorithm was used for designing IIR filters in [33] and for the leaf-constrained minimum spanning tree problem in [34].”
A survey: algorithms simulating bee swarm intelligence (2009, methodology): “Leaf-constrained minimum spanning tree (LCMST) problem Singh (2009)”