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):

Displaying 27 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)
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← 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)
• Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502) (← links)
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
• The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms (Q2230399) (← 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)
• A matheuristic approach for solving the 2-connected dominating set problem (Q4989008) (← 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)
• 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)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• Minimum weight clustered dominating tree problem (Q6109249) (← links)
• Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)