Pages that link to "Item:Q342262"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for two-level survivable network design problems (Q342262):
Displaying 18 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- A hub location problem with fully interconnected backbone and access networks (Q869014) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Redundancy system design for an aircraft door management system (Q1652598) (← links)
- Systems under attack-survivability rather than reliability: concept, results, and applications (Q1751760) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- A branch-and-cut approach for minimum cost multi-level network design (Q5957748) (← links)
