Solving Steiner tree problems in graphs with Lagrangian relaxation

DOI10.1023/A:1027368621279zbMath1175.90393MaRDI QIDQ1417851

Oscar Porto, Laura Bahiense, Francisco Barahona

Publication date: 6 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationSteiner trees

Mathematics Subject Classification ID

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

Related Items (12)

Traffic engineering of tunnel-based networks with class specific diversity requirements ⋮ A factoring approach for the Steiner tree problem in undirected networks ⋮ The rainbow Steiner tree problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Multicast tree rearrangement to recover node failures in overlay multicast networks ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

Uses Software

• SteinLib

This page was built for publication: Solving Steiner tree problems in graphs with Lagrangian relaxation