Pages that link to "Item:Q319657"
From MaRDI portal
The following pages link to Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657):
Displaying 6 items.
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
