Pages that link to "Item:Q1756586"

The following pages link to An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586):

Displaying 7 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)
• A generalization of the minimum branch vertices spanning tree problem (Q1661907) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• Minimizing branching vertices in distance-preserving subgraphs (Q2330556) (← links)
• An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
• A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)