Multi-service multi-facility network design under uncertainty
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5504153 (Why is no real title available?)
- scientific article; zbMATH DE number 1104922 (Why is no real title available?)
- A branch and bound method for stochastic global optimization
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Confidence level solutions for stochastic programming
- Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Multicommodity network flows: The impact of formulation on decomposition
- Recent developments in bootstrap methodology
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- Scenario tree modeling for multistage stochastic programs
- Stochastic Integer Programming: Limit Theorems and Confidence Intervals
- Telecommunication network capacity design for uncertain demand
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cited in
(5)- Telecommunication network capacity design for uncertain demand
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- scientific article; zbMATH DE number 3906198 (Why is no real title available?)
- Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
This page was built for publication: Multi-service multi-facility network design under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761754)