Optimization algorithms for resilient path selection in networks

DOI10.1016/j.cor.2020.105191OpenAlexW3116465178MaRDI QIDQ2027082

Marco Casazza, Alberto Ceselli

Publication date: 21 May 2021

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

Full work available at URL: http://hdl.handle.net/2434/807791

zbMATH Keywords

column generationfailure probabilitynetwork reliabilitybranch and pricepath selection

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• SCIP
• CPLEX
• aGrUM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum probability shortest path problem
• SCIP: solving constraint integer programs
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• Topological optimization of reliable networks under dependent failures
• Reliability problems in multiple path-shaped facility location on networks
• Combined location and routing problems for drug distribution
• The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Topological optimization of a communication network subject to a reliability constraint
• Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
• Polynomially Computable Bounds for the Probability of the Union of Events
• Design of Survivable Networks: A survey

This page was built for publication: Optimization algorithms for resilient path selection in networks