Pages that link to "Item:Q2914198"
From MaRDI portal
The following pages link to Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198):
Displaying 21 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Spanning trees with variable degree bounds (Q297415) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH (Q2790350) (← links)
- Spanning trees with node degree cependent costs and knapsack reformulations (Q2861520) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578) (← links)
- Two dependency constrained spanning tree problems (Q6067892) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
