A new linear path pair availability constraint for network design

DOI10.1002/NET.22239MaRDI QIDQ6599069zbMATH OpenFDO

Authors Lúcia Martins, Dorabella Santos, Rita Girão-Silva, Teresa Gomes

Publication date 5 September 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22239

zbMATH Keywords

convex relaxationlinear constraintsnetwork designoptimizationprotectionresilience

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Recommendations

• Availability-based path selection and network vulnerability assessment
• Connectivity Upgrade Models for Survivable Network Design
• Hop constrained network design problem with partial survivability
• Network synthesis under survivability constraints
• Network design with vulnerability constraints and probabilistic edge reliability

Cites work

• Availability-based path selection and network vulnerability assessment
• Network reliability: Heading out on the highway
• On the hop-constrained survivable network design problem with reliable edges

This page was built for publication: A new linear path pair availability constraint for network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599069)