Branch-and-cut approaches for chance-constrained formulations of reliable network design problems

DOI10.1007/s12532-013-0058-3zbMath1330.90057MaRDI QIDQ744205

Yongjia Song, James R. Luedtke

Publication date: 6 October 2014

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-013-0058-3

zbMATH Keywords

integer programming; chance constraints; reliable network design

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C15: Stochastic programming

Uses Software

• SCIP
• CPLEX
• OR-Library
• LEMON