Pages that link to "Item:Q2462545"
From MaRDI portal
The following pages link to Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545):
Displaying 9 items.
- A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
- Optimization of resource location in hierarchical computer networks (Q583895) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
- An improved lower bound for the multimedian location problem (Q1872010) (← links)
- Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
- Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
- (Q4709646) (← links)
- An effective algorithm for the two-stage location problem on a tree-like network (Q5263793) (← links)