A catalog of steiner tree formulations
From MaRDI portal
Publication:5285475
DOI10.1002/net.3230230104zbMath0794.90074OpenAlexW2119918317WikidataQ89217058 ScholiaQ89217058MaRDI QIDQ5285475
Young-Soo Myung, Michel X. Goemans
Publication date: 29 June 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230104
Related Items (52)
Arborescence polytopes for series-parallel graphs ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Reload cost trees and network design ⋮ Network flow models for the local access network expansion problem ⋮ On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree ⋮ A node rooted flow-based model for the local access network expansion problem ⋮ An Efficient Iterative Method for the Formulation of Flow Networks ⋮ Chvátal-Gomory cuts for the Steiner tree problem ⋮ On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints ⋮ New formulations and branch-and-cut procedures for the longest induced path problem ⋮ Cost optimized design for the local wind turbine grid of an onshore wind farm ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Stronger path‐based extended formulation for the Steiner tree problem ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ A linear programming based approach to the Steiner tree problem with a fixed number of terminals ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Optimizing the Design of a Wind Farm Collection Network ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ A polyhedral study of the diameter constrained minimum spanning tree problem ⋮ Vertex covering with capacitated trees ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Tree network design avoiding congestion ⋮ New geometry-inspired relaxations and algorithms for the metric Steiner tree problem ⋮ A note on the generalized Steiner tree polytope ⋮ Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems ⋮ Stronger MIP formulations for the Steiner forest problem ⋮ An Exact Algorithm for the Steiner Forest Problem ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ A multicast problem with shared risk cost ⋮ A partition-based relaxation for Steiner trees ⋮ The multi-weighted Steiner tree problem: A reformulation by intersection ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Steiner trees and polyhedra ⋮ A comparison of Steiner tree relaxations ⋮ Improved algorithms for the Steiner problem in networks ⋮ A comparative analysis of several formulations for the generalized minimum spanning tree problem ⋮ The regenerator location problem ⋮ Approximation of Steiner forest via the bidirected cut relaxation ⋮ Generalized network design problems. ⋮ Multicommodity flow models for spanning trees with hop constraints ⋮ Designing reliable tree networks with two cable technologies ⋮ Integer programming formulations for the shared multicast tree problem ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut ⋮ Political districting to minimize cut edges ⋮ Projection results for vehicle routing ⋮ The Steiner tree polytope and related polyhedra ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem
Cites Work
This page was built for publication: A catalog of steiner tree formulations
