The multi-weighted Steiner tree problem

DOI10.1007/BF02071982zbMath0744.90089MaRDI QIDQ1179753

Ton Volgenant, Cees W. Duin

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

spanning treeheuristic algorithmshierarchical networkmulti- weighted Steiner tree problemmulti-weighted graphspecial node set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

A branch and cut algorithm for the hierarchical network design problem ⋮ The multi-weighted spanning tree problem ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ The multi-weighted Steiner tree problem: A reformulation by intersection ⋮ An addendum to the hierarchical network design problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The hierarchical network design problem
• An edge elimination test for the Steiner problem in graphs
• Reducing the hierarchical network design problem
• A fast algorithm for Steiner trees
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Some generalizations of the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• Topological design of centralized computer networks—formulations and algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• An algorithm for the steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: The multi-weighted Steiner tree problem