Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
From MaRDI portal
Recommendations
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- The constrained minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- Degree-constrained \(k\)-minimum spanning tree problem
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- A multiperiod degree constrained minimal spanning tree problem
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- An optimization algorithm for solving degree-constrained minimum spanning tree problems
Cites work
- A branch and cut method for the degree-constrained minimum spanning tree problem
- A greedy heuristic for a minimum-weight forest problem
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An augmented arborescence formulation for the two-level network design problem
- Comparison of algorithms for the degree constrained minimum spanning tree
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Low-degree minimum spanning trees
- Minimal spanning trees with a constraint on the number of leaves
- On two geometric problems related to the travelling salesman problem
- Prize collecting Steiner trees with node degree dependent costs
- Spanning trees with node degree cependent costs and knapsack reformulations
- Topological design of centralized computer networks—formulations and algorithms
- Transitions in geometric minimum spanning trees
- Using Lagrangian dual information to generate degree constrained spanning trees
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Cited in
(23)- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
- A unifying model for locally constrained spanning tree problems
- The generalized dependency constrained spanning tree problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
- Spanning trees with node degree cependent costs and knapsack reformulations
- md-MST is NP-hard for \(d\geq 3\)
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Spanning trees with variable degree bounds
- A parallel Lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Two dependency constrained spanning tree problems
- On solving bi-objective constrained minimum spanning tree problems
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
This page was built for publication: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914198)
