Hop-constrained node survivable network design: An application to MPLS over WDM
From MaRDI portal
(Redirected from Publication:1035728)
Recommendations
- Hop constrained network design problem with partial survivability
- On the hop-constrained survivable network design problem with reliable edges
- A formulation for a hop constrained survivable network design problem
- Design of survivable networks with vulnerability constraints
- Two node-disjoint hop-constrained survivable network design and polyhedra
Cites work
- Connectivity-splitting models for survivable network design
- Design of survivable IP-over-optical networks
- Design of survivable networks
- scientific article; zbMATH DE number 1175959 (Why is no real title available?)
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions
- Strong formulations for network design problems with connectivity requirements
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Cited in
(16)- Layered graph approaches for combinatorial optimization problems
- The q-ad hoc hub location problem for multi-modal networks
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- Length-bounded cuts: proper interval graphs and structural parameters
- Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Solving survivable two-layer network design problems by metric inequalities
- The k edge-disjoint 3-hop-constrained paths polytope
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- A formulation for a hop constrained survivable network design problem
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Further contributions to network optimization
- scientific article; zbMATH DE number 7765394 (Why is no real title available?)
- Risk approaches for delivering disaster relief supplies
- Characterization of facets of the hop constrained chain polytope via dynamic programming
This page was built for publication: Hop-constrained node survivable network design: An application to MPLS over WDM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035728)
