Pages that link to "Item:Q3116739"
From MaRDI portal
The following pages link to Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements (Q3116739):
Displayed 9 items.
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Centrality measures for node-weighted networks via line graphs and the matrix exponential (Q820712) (← links)
- A mixed-integer approach to Core-Edge design of storage area networks (Q878574) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- A cost allocation problem arising in hub-spoke network systems (Q1885769) (← links)
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region (Q2468339) (← links)
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks (Q2885521) (← links)
- On mathematical optimization for clustering categories in contingency tables (Q6106171) (← links)