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 15 items.
- The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
- 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)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
