Design of survivable wireless backhaul networks with reliability considerations

DOI10.1016/j.cor.2022.106120MaRDI QIDQ6164320

Manoochehr Kelarestaghi, Mahdi Kabiri Beheshtkhah, Farshad Eshghi, Mohammad Ali Raayatpanah, Napoleão Nepomuceno

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

reliabilityquality of servicemixed integer linear programmingsurvivabilityaccelerated benders decompositionwireless backhaul network

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• An integer programming approach for linear programs with probabilistic constraints
• Solving chance-constrained combinatorial problems to optimality
• Sample average approximation method for chance constrained programming: Theory and applications
• A polyhedral approach to multicommodity survivable network design
• The Benders decomposition algorithm: a literature review
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
• Resilience and survivability in communication networks: strategies, principles, and survey of disciplines
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• Designing networks with resiliency to edge failures using two-stage robust optimization
• Survivable network design under optimal and heuristic interdiction scenarios
• On the mass COVID-19 vaccination scheduling problem
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
• Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks
• On cut-based inequalities for capacitated network design polyhedra
• Survivable capacitated network design problem: new formulation and Lagrangean relaxation
• Accelerating Benders method using covering cut bundle generation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• Robust and Adaptive Network Flows
• The Scenario Approach to Robust Control Design
• Design of Survivable Networks: A survey
• Robust network design: Formulations, valid inequalities, and computations
• Convex Approximations of Chance Constrained Programs
• Solving the edge‐disjoint paths problem using a two‐stage method

This page was built for publication: Design of survivable wireless backhaul networks with reliability considerations