Efficiency analysis of combinatorial algorithms for search of extremal trees on weighted graphs

The problem of search for a minimal «partial» tree on a weighted oriented graph is formally stated. A branch-and-bound solution algorithm is described. Results are given of experimentally checking the efficiency of combinatorial programming methods for the problem.