The multi-weighted Steiner tree problem: A reformulation by intersection

DOI10.1016/j.cor.2007.03.003zbMath1171.90533OpenAlexW2066230074MaRDI QIDQ2483504

João Telhada, Luís Gouveia

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.003

zbMATH Keywords

Lagrangean relaxationnetwork designlinear programming relaxationreformulation techniquesspanning trees and Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Branch-and-price algorithm for the resilient multi-level hop-constrained network design, A strong symmetric formulation for the min-degree constrained minimum spanning tree problem, Stronger path‐based extended formulation for the Steiner tree problem, Solving Steiner trees: Recent advances, challenges, and perspectives, A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• The hierarchical network design problem
• The multi-weighted Steiner tree problem
• Expressing combinatorial optimization problems by linear programs
• An augmented arborescence formulation for the two-level network design problem
• A Dual-Based Algorithm for Multi-Level Network Design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• A catalog of steiner tree formulations