An optimization algorithm for solving degree-constrained minimum spanning tree problems
From MaRDI portal
Publication:3170765
Recommendations
- Comparison of algorithms for the degree constrained minimum spanning tree
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
- Competitive decision algorithm for the degree-constrained minimum spanning tree
- Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
Cited in
(11)- The cellular competitive decision algorithm for the degree-constrained minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- Competitive decision algorithm for the degree-constrained minimum spanning tree
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- Minimum spanning trees made easier via multi-objective optimization
This page was built for publication: An optimization algorithm for solving degree-constrained minimum spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170765)