Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
From MaRDI portal
Publication:2901035
DOI10.1287/ijoc.1080.0266zbMath1243.90220OpenAlexW2104773527MaRDI QIDQ2901035
J. Cole Smith, April K. Andreas
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
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (7)
A global optimization algorithm for reliable network design ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ Algorithms for an integer multicommodity network flow problem with node reliability considerations ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
This page was built for publication: Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
