The edge-disjoing steiner problem in graphs

DOI10.1080/02331939608844173zbMath0854.90138OpenAlexW2071220278MaRDI QIDQ4893707

F. A. Compagner, A. Volgenant, Cees W. Duin

Publication date: 18 September 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844173

zbMATH Keywords

reliabilityNP-completeLagrange relaxationSteiner problem in graphsedge disjoint Steiner problemtree of minimum total weightupper bound generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• An SST-based algorithm for the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Planar Formulae and Their Uses
• On convergence rates of subgradient optimization methods
• Validation of subgradient optimization