News
P. C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1 (2009), pp. 104-118 ...
The Capacitated Minimum Spanning Tree Problem is NP-hard and several heuristic solution methods have been proposed. They can be classified as classical ones and metaheuristics. Recent developments ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback