Pages that link to "Item:Q4446914"
From MaRDI portal
The following pages link to Connectivity-splitting models for survivable network design (Q4446914):
Displaying 11 items.
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
- Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545) (← links)
- Strong lower bounds for a survivable network design problem (Q2883576) (← links)
- Connectivity Upgrade Models for Survivable Network Design (Q5188992) (← links)
- A graph theory approach for designing conservation reserve networks with minimal fragmentation (Q5449669) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
