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

DOI10.1080/03155986.1990.11732136zbMath0721.90078OpenAlexW2275351491MaRDI QIDQ5753762

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

Steiner tree problemapproximate solutionminimum spanning treeundirected graphreoptimizationsuper-modularitygreedy procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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)

Related Items (7)

A robust and scalable algorithm for the Steiner problem in graphs ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ Solving group Steiner problems as Steiner problems. ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems ⋮ Generalized spanning trees ⋮ Neural and delay based heuristics for the Steiner problem in networks

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