Pages that link to "Item:Q1083378"
From MaRDI portal
The following pages link to The hierarchical network design problem (Q1083378):
Displayed 17 items.
- A minimum length covering subgraph of a network (Q920001) (← links)
- Optimal design of hierarchical networks with free main path extremes (Q943800) (← links)
- Reducing the hierarchical network design problem (Q1121181) (← links)
- The hierarchical network design problem with transshipment facilities (Q1178636) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- Locating concentrators in centralized computer networks (Q1197789) (← links)
- An addendum to the hierarchical network design problem (Q1268252) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- The hierarchical network design problem with multiple primary paths (Q1278494) (← links)
- Efficient solution methods for covering tree problems (Q1284598) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Investment planning for urban roads (Q1322152) (← links)
- A suboptimal solution to a hierarchical network design problem using dynamic programming (Q1388941) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504) (← links)
- Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)