Pages that link to "Item:Q611003"
From MaRDI portal
The following pages link to Lagrangean bounds for the optimum communication spanning tree problem (Q611003):
Displaying 13 items.
- Looking for edge-equitable spanning trees (Q336753) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Range minimization problems in path-facility location on trees (Q713326) (← 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)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← 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)