Learn More
Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks on this graph a spanning tree of minimum weight among all the spanning trees of the graph that have at least ‘ leaves. In this paper, we have proposed an artificial bee colony (ABC) algorithm for the LCMST problem. The ABC algorithm is a new(More)
The multiple traveling salesperson problem (MTSP) is an extension of the well known traveling salesperson problem (TSP). Given m > 1 salespersons and n > m cities to visit, the MTSP seeks a partition of cities into m groups as well as an ordering among cities in each group so that each group of cities is visited by exactly one salesperson in their specified(More)