A heuristic for the Steiner problem in graphs

DOI10.1007/BF00248006zbMath0851.90126MaRDI QIDQ1918915

B. N. Khoury, Panos M. Pardalos

Publication date: 23 July 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

heuristicminimum spanning treeSteiner problem in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

A survey of combinatorial optimization problems in multicast routing ⋮ Mathematical programming approaches for dual multicast routing problem with multilayer risk cost ⋮ An exact branch and bound algorithm for the Steiner Problem in Graphs ⋮ Optimizing the Design of a Wind Farm Collection Network ⋮ A multicast problem with shared risk cost ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models ⋮ A Hybrid Metaheuristic for Routing on Multicast Networks

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Path-distance heuristic for the Steiner problem in undirected networks
• A heuristic for Euclidean and rectilinear Steiner problems
• Steiner's problem in graphs: Heuristic methods
• The Steiner tree problem
• On finding steiner vertices
• Steiner problem in networks: A survey
• On Steiner Minimal Trees with Rectilinear Distance
• A test problem generator for the Steiner problem in graphs
• Steiner's problem in graphs and its implications
• Steiner tree problems

This page was built for publication: A heuristic for the Steiner problem in graphs