Pages that link to "Item:Q2507388"
From MaRDI portal
The following pages link to Algorithms for the optimum communication spanning tree problem (Q2507388):
Displaying 11 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Communication tree problems (Q995575) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701) (← links)
- Costing communication standards in information systems using a minimum cut approach (Q4678243) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- On Optimal Solutions for the Optimal Communication Spanning Tree Problem (Q5189006) (← links)