Lower and upper bounds for the degree-constrained minimum spanning tree problem
From MaRDI portal
Publication:3593370
DOI10.1002/net.20166zbMath1119.90069OpenAlexW4251562717MaRDI QIDQ3593370
Abilio Lucena, Alexandre Salles da Cunha
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20166
Lagrangian relaxationblossom inequalitiesdegree constrained minimum spanning treeLagrangian warm start to cutting plane algorithmsnon-delayed relax-and-cut
Related Items
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm ⋮ The salesman and the tree: the importance of search in CP ⋮ Spanning trees with variable degree bounds ⋮ Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations ⋮ The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm ⋮ Exact algorithms for the vertex separator problem in graphs ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Unnamed Item ⋮ Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs ⋮ Further contributions to network optimization ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Cites Work
