Pages that link to "Item:Q3116635"
From MaRDI portal
The following pages link to Design of Communication Networks with Survivability Constraints (Q3116635):
Displaying 6 items.
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- Minimum<i>k</i>-geodetically connected digraphs (Q3157033) (← links)
- Towards minimum<i>k</i>-geodetically connected graphs (Q4804165) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)