Pages that link to "Item:Q632386"
From MaRDI portal
The following pages link to Bounded-degree spanning tree problems: models and new algorithms (Q632386):
Displaying 17 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- A generalization of the minimum branch vertices spanning tree problem (Q1661907) (← 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)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← 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)
- New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
- Lower bound for the cost of connecting tree with given vertex degree sequence (Q4958799) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
