An artificial immune algorithm for minimal steiner tree problems


The Minimum Steiner tree (MST) problem in the Euclidean plane is an nonlinear programming hard (NP-hard) problem, polynomial time algorithm is absent for solving the MST for a group of arbitrary terminal points, and the most difficulty is how to determine the position and number of Steiner points. A new method to solve MST problem by using an artificial… (More)


8 Figures and Tables

Slides referencing similar topics