Pages that link to "Item:Q1026247"
From MaRDI portal
The following pages link to Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247):
Displaying 7 items.
- An approximation algorithm for the \(k\)-level concentrator location problem (Q408401) (← links)
- A new mixed integer linear programming model for the multi level uncapacitated facility location problem (Q1630134) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- Bounded-hop communication networks (Q1755730) (← links)
- Minimizing energies with hierarchical costs (Q1931618) (← links)
- On the Bounded-Hop Range Assignment Problem (Q3449812) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
