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

DOI10.1016/J.COR.2007.03.003MaRDI QIDQ2483504zbMATH OpenOpenAlexFDO

Authors João Telhada, Luis 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

network designLagrangean relaxationlinear programming relaxationreformulation techniquesspanning trees and Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A strong lower bound for the Node Weighted Steiner Tree Problem
• The multi-weighted Steiner tree problem
• Reformulation by intersection method on the MST problem with lower bound on the number of leaves
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The node-weighted steiner tree problem

Cites work

• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A Dual-Based Algorithm for Multi-Level Network Design
• A catalog of steiner tree formulations
• An augmented arborescence formulation for the two-level network design problem
• Expressing combinatorial optimization problems by linear programs
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• The hierarchical network design problem
• The multi-weighted Steiner tree problem

Cited in

(8)

• Reformulation by intersection method on the MST problem with lower bound on the number of leaves
• Stronger path‐based extended formulation for the Steiner tree problem
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• 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
• A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Using multiflow formulations to solve the Steiner tree problem in graphs

This page was built for publication: The multi-weighted Steiner tree problem: A reformulation by intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483504)