Decomposition methods for network optimization problems in the presence of uncertainty

MaRDI QIDQ4363169zbMATH OpenFDO

Authors Francesco Fantauzzi, Alexei Gaivoronski, Enza Messina

Publication date 13 November 1997

zbMATH Keywords

asynchronous transfer modedesign of high speed data networknetwork design problemsstochastic programmingstochastic quasigradient methodssuccessive polyhedral approximationuncertainty

Mathematics Subject Classification ID

Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
• A class of network design problems with multiple demand: Model formulation and an algorithmic approach
• A robustness approach to uncapacitated network design problems
• The role of stochastic programming in communication network design
• A network recourse decomposition method for dynamic networks with random arc capacities

Cited in

(4)

• Uncertain graph and network optimization
• Solving network design problems via decomposition, aggregation and approximation. With an application to the optimal expansion of railway infrastructure
• A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty

This page was built for publication: Decomposition methods for network optimization problems in the presence of uncertainty

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