Pages that link to "Item:Q5318274"

The following pages link to Design of Survivable Networks: A survey (Q5318274):

Displaying 50 items.

• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions (Q264305) (← links)
• Optimal capacitated ring trees (Q286687) (← links)
• Incremental network design with shortest paths (Q296857) (← links)
• Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
• Energy-aware survivable networks (Q325416) (← links)
• Hierarchical survivable network design problems (Q325448) (← links)
• On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
• Optimal design and defense of networks under link attacks (Q502337) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
• The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Design of survivable networks with vulnerability constraints (Q1698886) (← links)
• Bilevel model for adaptive network flow problem (Q1742209) (← links)
• A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
• Formulations for designing robust networks. An application to wind power collection (Q1742258) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Optimization algorithms for resilient path selection in networks (Q2027082) (← links)
• On superperfection of edge intersection graphs of paths (Q2056890) (← links)
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
• Placing Green bridges optimally, with a multivariate analysis (Q2117784) (← links)
• Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
• On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
• Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
• The two-level diameter constrained spanning tree problem (Q2340278) (← links)
• Design and dimensioning of hydrogen transmission pipeline networks (Q2355838) (← links)
• A global optimization algorithm for reliable network design (Q2379515) (← links)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
• Network design and defence (Q2636766) (← links)
• Unreliable point facility location problems on networks (Q2636810) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• Strong Lower Bounds for a Survivable Network Design Problem (Q2883576) (← links)
• Survivability in hierarchical telecommunications networks (Q2892145) (← links)
• Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
• A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
• Incremental Network Design with Minimum Spanning Trees (Q2971398) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)