Pages that link to "Item:Q1413822"
From MaRDI portal
The following pages link to An exact algorithm for the maximum leaf spanning tree problem. (Q1413822):
Displaying 21 items.
- Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- The connected domination number of grids (Q831725) (← 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)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← 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)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Spanning trees of totally edge-growing network models (Q2823412) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- (Q2992654) (← links)
- The regenerator location problem (Q3057148) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem (Q3451414) (← links)
- (Q3581682) (← links)
- The maximum-leaf spanning tree problem: Formulations and facets (Q4474303) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
