A Branch and Cut Algorithm for a Steiner Tree-Star Problem
From MaRDI portal
Publication:5690260
Recommendations
- Solving Steiner tree problems in graphs to optimality
- A branch and cut algorithm for the Steiner problem in graphs
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- A branch-and-cut algorithm for the Steiner tree problem with delays
- A branch and cut method for the degree-constrained minimum spanning tree problem
Cited in
(23)- The General Steiner Tree-Star problem.
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
- Approximate robust optimization for the connected facility location problem
- A branch-and-cut algorithm for the equicut problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- A branch-and-cut algorithm for the Steiner tree problem with delays
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Branch-and-price approaches for the network design problem with relays
- MIP models for connected facility location: a theoretical and computational study
- Solving Steiner tree problems in graphs to optimality
- A two-level off-grid electric distribution problem on the continuous space
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- An exact algorithm for the Steiner tree problem with delays
- A learning based algorithm for drone routing
- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
- Branch-and-cut-and-price for capacitated connected facility location
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- An algorithmic framework for the exact solution of tree-star problems
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
This page was built for publication: A Branch and Cut Algorithm for a Steiner Tree-Star Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690260)
