Chance-constrained multi-terminal network design problems

DOI10.1002/NAV.21630MaRDI QIDQ4632888zbMATH OpenOpenAlexFDO

Authors Yongjia Song, Minjiao Zhang

Publication date 2 May 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21630

zbMATH Keywords

Benders decompositionchance constraintSteiner treestochastic network design

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Stochastic survivable network design problems: theory and practice
• On the hop-constrained survivable network design problem with reliable edges
• Network design with probabilistic capacities
• Two-Stage Robust Network Design with Exponential Scenarios

Cited in

(6)

• Stochastic survivable network design problems: theory and practice
• A multivariate analysis of the strict terminal connection problem
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
• Robust capacitated Steiner trees and networks with uniform demands
• Valid inequalities for the -edge disruptor problem
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: Chance-constrained multi-terminal network design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632888)