The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative ...

The algorithm will not necessarily produce a minimal-spanning tree, even under the constraints that the routing network is complete and the distances are Euclidean.