Pages that link to "Item:Q4648687"
From MaRDI portal
The following pages link to Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687):
Displaying 4 items.
- Spanning trees with variable degree bounds (Q297415) (← links)
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Single PON network design with unconstrained splitting stages (Q2629639) (← links)
