Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity

DOI10.1080/03155986.1990.11732136MaRDI QIDQ5753762zbMATH OpenOpenAlexFDO

Authors Michel Minoux

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.11732136

zbMATH Keywords

approximate solutiongreedy procedureminimum spanning treereoptimizationSteiner tree problemsuper-modularityundirected graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3918122
• On greedy heuristic for Steiner minimum trees
• scientific article; zbMATH DE number 3871417
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Efficient path and vertex exchange in steiner tree algorithms

Cited in

(7)

• Neural and delay based heuristics for the Steiner problem in networks
• Solving group Steiner problems as Steiner problems.
• Generalized spanning trees
• A robust and scalable algorithm for the Steiner problem in graphs
• Swap-vertex based neighborhood for Steiner tree problems
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
• Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem

This page was built for publication: Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity

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