A dual ascent approach for steiner tree problems on a directed graph
- 734 Downloads
The Steiner tree problem on a directed graph (STDG) is to find a directed subtree that connects a root node to every node in a designated node setV. We give a dual ascent procedure for obtaining lower bounds to the optimal solution value. The ascent information is also used in a heuristic procedure for obtaining feasible solutions to the STDG. Computational results indicate that the two procedures are very effective in solving a class of STDG's containing up to 60 nodes and 240 directed/120 undirected arcs.
The directed spanning tree and uncapacitated plant location problems are special cases of the STDG. Using these relationships, we show that our ascent procedure can be viewed as a generalization ofboth the Chu-Liu-Edmonds directed spanning tree algorithm and the Bilde-Krarup-Erlenkotter ascent algorithm for the plant location problem. The former comparison yields a dual ascent interpretation of the steps of the directed spanning tree algorithm.
Key wordsSteiner Tree Problem on a Graph Dual Ascent Method Directed Spanning Tree Algorithm
Unable to display preview. Download preview PDF.
- R.E. Erickson, C.L. Monma and A.F. Veinott, Jr., “Minimum concave cost network flows”, unpublished manuscript, Bell Laboratories (Holmdel, NJ, 1981).Google Scholar
- M.L. Fisher, R. Jaikumar and L. Van Wassenhov, “A multiplier adjustment method for the generalized assignment problem”, contributed paper, ORSA/TIMS Meeting, Washington, D.C., May 1980.Google Scholar
- M. Guignard and K. Spielberg, “A direct dual approach to a transshipment formulation for multi-layer network problems with fixed charges”, Technical Report 43, Department of Statistics, University of Pennsylvania, (Philadelphia, PA, 1979).Google Scholar
- T.L. Magnanti and R.T. Wong, “Network design and transportation planning: Models and algorithms”,Transportation Science, to appear.Google Scholar
- P.B. Mirchandani, “Analysis of stochastic networks in emergency service systems”, Technical Report TR-15-75, Innovative Resources Planning Project, massachusetts Institute of Technology (Cambridge, MA, 1975).Google Scholar
- R.L. Rardin, “Tight relaxations of fixed charge network flow problems”, Technical Report J-82-3, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1982).Google Scholar
- R.L. Rardin, R.G. Parker and W.K. Lim, “Some polynomially solvable multi-commodity fixed charge network flow problems”, Technical Report J-82-2, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1982).Google Scholar
- J. Suurballe, “Algorithms for minimal trees and semi-Steiner trees based on the simplex method”, in: H.W. Kuhn, ed. Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, NJ, 1970) pp. 614–615.Google Scholar