Pages that link to "Item:Q1991267"
From MaRDI portal
The following pages link to Solving the optimum communication spanning tree problem (Q1991267):
Displaying 11 items.
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← 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)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (Q3026701) (← 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)
- Models of random subtrees of a graph (Q6183888) (← links)
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)