The tree-star problem: a formulation and a branch-and-cut algorithm
From MaRDI portal
Recommendations
- A branch and cut method for the degree-constrained minimum spanning tree problem
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
Cites work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Strong lower bounds for the prize collecting Steiner problem in graphs
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
Cited in
(7)- An algorithmic framework for the exact solution of tree-star problems
- A new formulation for spanning trees
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- On the Optimal Stars Clustering Tree Problem
- The solutions of two star-height problems for regular trees
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- The complete optimal stars-clustering-tree problem
This page was built for publication: The tree-star problem: a formulation and a branch-and-cut algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325465)
