A Polynomial Algorithm for the Minimum Spanning Arborescence in Transportation Networks with Bitype Arc Costs

이중비용 네트워크에서의 최소비용 극대방향 나무 해법

Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.