A lower bound for the steiner tree problem in directed graphs

DOI10.1002/net.3230200606zbMath0721.90076OpenAlexW2044506432MaRDI QIDQ5753759

Weiguo Liu

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200606

zbMATH Keywords

projection methodlower bounddirected graphsdual ascent algorithmminimum Steiner tree problem

Mathematics Subject Classification ID

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

Related Items (8)

A factoring approach for the Steiner tree problem in undirected networks ⋮ A constrained Steiner tree problem ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Facets of two Steiner arborescence polyhedra ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Heuristic algorithms for packing of multiple-group multicasting ⋮ Unnamed Item

Cites Work

• Optimum branchings

This page was built for publication: A lower bound for the steiner tree problem in directed graphs