Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms

DOI10.1080/03155986.1990.11732138zbMath0724.90073OpenAlexW306252662MaRDI QIDQ5202521

Bezalel Gavish, Moshe Dror, Jean Choquette

Publication date: 1990

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1990.11732138

zbMATH Keywords

directed Steiner treeLagrangean relaxationsfinite directed and connected edge-weighted graphleast weight tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A factoring approach for the Steiner tree problem in undirected networks ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ An approach for the Steiner problem in directed graphs ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Heuristic algorithms for packing of multiple-group multicasting ⋮ Generalized spanning trees