The following pages link to (Q2861520):
Displaying 4 items.
- Spanning trees with variable degree bounds (Q297415) (← links)
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
