An approach for the Steiner problem in directed graphs

DOI10.1007/BF02071983zbMath0744.90092OpenAlexW1967379196MaRDI QIDQ1179756

Paulo Souza, Nelson F. Maculan, Alfredo Candia-Véjar

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02071983

zbMATH Keywords

upper boundsenumerationspanning treelower boundsheuristic methodranking algorithmSteiner problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

An approach for the Steiner problem in directed graphs ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Algorithms for a multi-level network optimization problem

Cites Work

• Unnamed Item
• An approach for the Steiner problem in directed graphs
• A dual ascent approach for steiner tree problems on a directed graph
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• Thek best spanning arborescences of a network
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
• An algorithm for the steiner problem in graphs

This page was built for publication: An approach for the Steiner problem in directed graphs