Constructing optimal treelike networks

This report deals with the exact and approximate algorithms for optimal network construction with discontinuous cost functions depending on the flow at their edges. The properties of the optimal solution of this problem are established, an algorithm for generating all trees and single root subtrees for the graph under consideration is described.