Pages that link to "Item:Q3091486"
From MaRDI portal
The following pages link to Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves (Q3091486):
Displayed 3 items.
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)