Degree-constrained \(k\)-minimum spanning tree problem

DOI10.1155/2020/7628105zbMath1454.90102OpenAlexW3104175966MaRDI QIDQ2221985

Ali Dehghan Firoozabadi, Pablo Adasme

Publication date: 3 February 2021

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/7628105

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• CPLEX
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
• The Steiner tree problem on graphs: inapproximability results
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• Variable neighborhood search
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
• Integer programming for urban design
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Facility location with tree topology and radial distance constraints
• Using Lagrangian dual information to generate degree constrained spanning trees
• A branch and cut method for the degree-constrained minimum spanning tree problem
• Saving an epsilon
• Stochastic maximum weight forest problem
• Spanning Trees—Short or Small
• Cooperative Control of Multiple Agents With Unknown High-Frequency Gain Signs Under Unbalanced and Switching Topologies
• Variable neighborhood search: Principles and applications
• Comparison of algorithms for the degree constrained minimum spanning tree

This page was built for publication: Degree-constrained \(k\)-minimum spanning tree problem