A dual ascent approach for steiner tree problems on a directed graph
- 1 October 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 28 (3) , 271-287
- https://doi.org/10.1007/bf02612335
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Network Design and Transportation Planning: Models and AlgorithmsTransportation Science, 1984
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection CriteriaOperations Research, 1981
- Database Location in Computer NetworksJournal of the ACM, 1980
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- A direct dual method for the mixed plant location problem with some side constraintsMathematical Programming, 1979
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971