Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds
References (9)
- et al.
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics
(2006) - et al.
Variable neighborhood search for the degree-constrained minimum spanning tree problem
Discrete Appl. Math.
(2002) - et al.
A branch and cut method for the degree-constrained minimum spanning tree problem
Networks
(2001) - et al.
Lower and upper bounds for the degree-constrained minimum spanning tree problem
Networks
(2007)
There are more references available in the full text version of this article.
Cited by (4)
Improved solution strategies for dominating trees
2018, Expert Systems with ApplicationsMTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles
2020, Annals of Operations ResearchTrees and forests
2018, Handbook of HeuristicsBranch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem
2016, Computational Optimization and Applications
Copyright © 2013 Elsevier B.V. All rights reserved.