A branch and cut method for the degree-constrained minimum spanning tree problem
From MaRDI portal
Recommendations
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
Cited in
(39)- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- Finding extremal carcasses with preset vertex degrees by the replacement method
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Binary Steiner trees: structural results and an exact solution approach
- Design of capacitated degree constrained min-sum arborescence
- An exact algorithm for multi-constrained minimum spanning tree problem
- Degree-constrained \(k\)-minimum spanning tree problem
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Using Lagrangian dual information to generate degree constrained spanning trees
- A note on relatives to the Held and Karp 1-tree problem
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Spanning trees with variable degree bounds
- On the weight-constrained minimum spanning tree problem
- Relax-and-cut as a preprocessor and warm starter to branch-and-cut
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- Optimality cuts and a branch-and-cut algorithm for the k-rooted mini-max spanning forest problem
- The tree-star problem: a formulation and a branch-and-cut algorithm
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Designing a minimal spanning tree network subject to a budget constraint
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
- scientific article; zbMATH DE number 1054929 (Why is no real title available?)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
- A Branch and Cut Algorithm for a Steiner Tree-Star Problem
- Branch and cut methods for network optimization
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- Non delayed relax-and-cut algorithms
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
This page was built for publication: A branch and cut method for the degree-constrained minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714906)
