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

DOI10.1080/03155986.1990.11732138MaRDI QIDQ5202521zbMATH OpenOpenAlexFDO

Authors Moshe Dror, Bezalel Gavish, 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 treefinite directed and connected edge-weighted graphLagrangean relaxationsleast weight tree

Mathematics Subject Classification ID

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

Recommendations

• A catalog of steiner tree formulations
• scientific article; zbMATH DE number 4089579
• A dual ascent approach for steiner tree problems on a directed graph
• An algorithm for the steiner problem in graphs
• An SST-based algorithm for the steiner problem in graphs
• An approach for the Steiner problem in directed graphs
• A branch and cut algorithm for the Steiner problem in graphs
• Models and heuristics for a minimum arborescence problem
• Solving Steiner tree problems in graphs to optimality
• Some generalizations of the steiner problem in graphs

Cited in

(15)

• An approach for the Steiner problem in directed graphs
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• Generalized spanning trees
• Worst-case performance of Wong's Steiner tree heuristic
• A dual ascent approach for steiner tree problems on a directed graph
• Lehman's theorem and the directed Steiner tree problem
• scientific article; zbMATH DE number 4089579 (Why is no real title available?)
• On a directed tree problem motivated by a newly introduced graph product
• A catalog of steiner tree formulations
• Linear Programming Hierarchies Suffice for Directed Steiner Tree
• Models and heuristics for a minimum arborescence problem
• A lower bound for the steiner tree problem in directed graphs
• Heuristic algorithms for packing of multiple-group multicasting
• Solving Steiner trees: Recent advances, challenges, and perspectives
• A factoring approach for the Steiner tree problem in undirected networks

This page was built for publication: Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202521)