Pages that link to "Item:Q1652257"

The following pages link to A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257):

Displaying 18 items.

• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
• Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
• 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)
• Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← 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)
• 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)
• A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
• Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
• Improved approaches to solve the one-to-one skewgram problem (Q2669687) (← links)
• A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Spanning Trees with Few Branch Vertices (Q5232165) (← links)
• A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)