Mathematical programming algorithms for two-path routing problems with reliability considerations
DOI10.1287/IJOC.1080.0266zbMATH Open1243.90220OpenAlexW2104773527MaRDI QIDQ2901035FDOQ2901035
Authors: April K. Andreas, J. Cole Smith 
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bde2936c7fb4676efff2322fe8879158ba34a0f9
Recommendations
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Optimization algorithms for resilient path selection in networks
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cited In (10)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A global optimization algorithm for reliable network design
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Optimal network design with end-to-end service requirements
- On the chance-constrained minimum spanning \(k\)-core problem
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
This page was built for publication: Mathematical programming algorithms for two-path routing problems with reliability considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901035)
