Performance Analysis of Algorithms for the Steiner Problem in Directed Networks

The Steiner problem in directed networks asks for the minimum total weight directed tree spanning a group of nodes of a directed and arc-weighted network. We analize the worst-case performance of several algorithms for this problem and also we discuss the comparability problem between these algorithms. rmore, the empirical performance of a proposed hybrid approach is analized for some instances from the simple location problem.