Pages that link to "Item:Q2940057"

The following pages link to Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057):

Displayed 16 items.

• Flow-based formulation for the maximum leaf spanning tree problem (Q324785) ‎ (← links)
• A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472) ‎ (← links)
• A new branch-and-cut approach for the generalized regenerator location problem (Q827283) ‎ (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) ‎ (← links)
• Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) ‎ (← links)
• The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) ‎ (← links)
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) ‎ (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) ‎ (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) ‎ (← links)
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem (Q2289917) ‎ (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) ‎ (← links)
• Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) ‎ (← links)
• Regenerator Location Problem in Flexible Optical Networks (Q4604897) ‎ (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) ‎ (← links)
• Exact Approaches for Network Design Problems with Relays (Q5137444) ‎ (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) ‎ (← links)