scientific article; zbMATH DE number 795223
From MaRDI portal
Publication:4845372
Recommendations
Cited in
(only showing first 100 items - show all)- On the complexity of resilient network design
- Cost-effective designs of fault-tolerant access networks in communication systems
- Graphs and algorithms in communication networks on seven league boots
- Some thoughts on combinatorial optimisation
- Graph fragmentation problem: analysis and synthesis
- Design of survivable networks with low connectivity requirements
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem
- Two-connected Steiner networks: structural properties
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- A graph based model for survivability applications
- Redundancy system design for an aircraft door management system
- How Do You Defend a Network?
- Two node-disjoint hop-constrained survivable network design and polyhedra
- Polyhedral approaches to the design of survivable networks
- Splitting off edges between two subsets preserving the edge-connectivity of the graph.
- More facets for survivable networks
- Robust capacitated Steiner trees and networks with uniform demands
- Valid inequalities and facets for multi‐module survivable network design problem
- Approximating unweighted connectivity problems in parallel
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction
- On shortest three-edge-connected Steiner networks with Euclidean distance
- On the two-connected planar spanning subgraph polytope
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks
- An Integer Polytope Related to the Design of Survivable Communication Networks
- scientific article; zbMATH DE number 1184420 (Why is no real title available?)
- A generic optimization framework for resilient systems
- Large scale linear programs and heuristics for the design of survivable telecommunication networks
- Network design with vulnerability constraints and probabilistic edge reliability
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- scientific article; zbMATH DE number 1953178 (Why is no real title available?)
- Erdős–Pósa property of obstructions to interval graphs
- Bipartition constrained edge-splitting in directed graphs
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP
- Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)
- Separation of partition inequalities with terminals
- Network disconnection problems in a centralized network
- Task scheduling in networks
- Survivability in hierarchical telecommunications networks under dual homing
- The multi-layered network design problem
- Survivability in hierarchical telecommunications networks
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- An efficient approximation algorithm for the survivable network design problem
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- The 2-edge-connected subgraph polyhedron
- Design of survivable networks with vulnerability constraints
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Stochastic survivable network design problems: theory and practice
- A bootstrap heuristic for designing minimum cost survivable networks
- A branch-and-cut algorithm for two-level survivable network design problems
- Finding totally independent spanning trees with linear integer programming
- A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- Heuristics for the network design problem with connectivity requirements
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- The swap edges of a multiple-sources routing tree
- Efficient methods for the distance-based critical node detection problem in complex networks
- Designing survivable networks with zero-suppressed binary decision diagrams
- The \(k\)-path tree matroid and its applications to survivable network design
- Design of survivable IP-over-optical networks
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Topological design of survivable mesh-based transport networks
- Online and Stochastic Survivable Network Design
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- Network synthesis under survivability constraints
- A polyhedral approach to multicommodity survivable network design
- Properties of optimal survivable paths in a graph
- Telecommunication node clustering with node compatibility and network survivability requirements
- Strong lower bounds for a survivable network design problem
- Connectivity Upgrade Models for Survivable Network Design
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem
- scientific article; zbMATH DE number 1696669 (Why is no real title available?)
- scientific article; zbMATH DE number 1535630 (Why is no real title available?)
- On perfectly two-edge connected graphs
- Design of survivable networks
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- Generalized network design problems.
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- On survivable network polyhedra
- Design of communication networks with survivability constraints
- Telecommunications network design: Technology impacts and future directions
- Cutting planes in integer and mixed integer programming
- Augmenting edge-connectivity between vertex subsets
- Design of Survivable Networks: A survey
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Price of Stability in Survivable Network Design
- \(k\)-edge connected polyhedra on series-parallel graphs
- Selected topics in critical element detection
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
- Equal-need sharing of a network under connectivity constraints
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- On the Steiner 2-edge connected subgraph polytope
- Hierarchical survivable network design problems
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845372)
