Pages that link to "Item:Q496663"
From MaRDI portal
The following pages link to The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663):
Displaying 8 items.
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← 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)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
