Pages that link to "Item:Q1652257"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257):
Displayed 8 items.
- 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)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Improved approaches to solve the one-to-one skewgram problem (Q2669687) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (Q6148080) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)