Pages that link to "Item:Q325449"
From MaRDI portal
The following pages link to A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449):
Displaying 6 items.
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← 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)
- 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)
- Spanning trees with node degree cependent costs and knapsack reformulations (Q2861520) (← links)