Pages that link to "Item:Q2781139"
From MaRDI portal
The following pages link to Designing hierarchical survivable networks (Q2781139):
Displaying 13 items.
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
- New formulations and solution procedures for the hop constrained network design problem. (Q1810496) (← links)
- Single-commodity network design with random edge capacities (Q1926752) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)