Pages that link to "Item:Q377727"

The following pages link to Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727):

Displaying 20 items.

• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
• Transforming spanning trees: A lower bound (Q1028225) (← links)
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
• Truck synchronization at single door cross-docking terminals (Q1656428) (← links)
• An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← 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)
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
• Approximating spanning trees with few branches (Q2344216) (← 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)
• Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints (Q4603928) (← links)
• Spanning Trees with Few Branch Vertices (Q5232165) (← links)
• OMEGA one multi ethnic genetic approach (Q5963233) (← links)
• Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
• A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)