Pages that link to "Item:Q2255965"
From MaRDI portal
The following pages link to Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965):
Displaying 11 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints (Q4603928) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- OMEGA one multi ethnic genetic approach (Q5963233) (← links)
