Pages that link to "Item:Q993702"

The following pages link to Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702):

Displaying 19 items.

• Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
• The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
• Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
• Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• The Generalized Regenerator Location Problem (Q3466768) (← links)
• Regenerator Location Problem in Flexible Optical Networks (Q4604897) (← links)
• Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
• Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)