A catalog of steiner tree formulations
From MaRDI portal
Publication:5285475
Recommendations
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- A comparison of Steiner tree relaxations
- scientific article; zbMATH DE number 4089579
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
Cites work
Cited in
(57)- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
- A multicast problem with shared risk cost
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Stronger MIP formulations for the Steiner forest problem
- Chvátal-Gomory cuts for the Steiner tree problem
- Network flow models for the local access network expansion problem
- Stronger path‐based extended formulation for the Steiner tree problem
- Binary Steiner trees: structural results and an exact solution approach
- Integer programming formulations for the shared multicast tree problem
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Reload cost trees and network design
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- A note on the generalized Steiner tree polytope
- Vertex covering with capacitated trees
- An efficient iterative method for the formulation of flow networks
- Designing reliable tree networks with two cable technologies
- Optimizing the Design of a Wind Farm Collection Network
- Arborescence polytopes for series-parallel graphs
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- MIP models for connected facility location: a theoretical and computational study
- Robust capacitated Steiner trees and networks with uniform demands
- MIP formulations for induced graph optimization problems: a tutorial
- Some formulations for the group Steiner tree problem
- The Steiner tree polytope and related polyhedra
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- A node rooted flow-based model for the local access network expansion problem
- Worst-case performance of Wong's Steiner tree heuristic
- A comparison of Steiner tree relaxations
- Improved algorithms for the Steiner problem in networks
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Approximation of Steiner forest via the bidirected cut relaxation
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
- Steiner trees and polyhedra
- scientific article; zbMATH DE number 4089579 (Why is no real title available?)
- Optimal connected subgraphs: Integer programming formulations and polyhedra
- Using multiflow formulations to solve the Steiner tree problem in graphs
- Cost optimized design for the local wind turbine grid of an onshore wind farm
- A partition-based relaxation for Steiner trees
- The regenerator location problem
- An Exact Algorithm for the Steiner Forest Problem
- Tree network design avoiding congestion
- Generalized network design problems.
- Multicommodity flow models for spanning trees with hop constraints
- New formulations and branch-and-cut procedures for the longest induced path problem
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- A comparative analysis of several formulations for the generalized minimum spanning 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
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- A polyhedral study of the diameter constrained minimum spanning tree problem
- Projection results for vehicle routing
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Political districting to minimize cut edges
This page was built for publication: A catalog of steiner tree formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285475)
