Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
From MaRDI portal
Publication:3115997
DOI10.1287/MNSC.1060.0536zbMATH Open1232.90312OpenAlexW2147896682MaRDI QIDQ3115997FDOQ3115997
Authors: Rafael Andrade, Abdel Lisser, Gérard Plateau, Nelson Maculan 
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1060.0536
Recommendations
- 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
- A stochastic integer programming approach to solving a synchronous optical network ring design problem
- Stochastic survivable network design problems: theory and practice
- A branch and bound method for stochastic integer problems under probabilistic constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Integer programming (90C10)
Cited In (9)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- Multi-service multi-facility network design under uncertainty
- Stochastic set packing problem
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
- Robust network design with uncertain outsourcing cost
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Structuring bilateral energy contract portfolios in competitive markets
This page was built for publication: Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115997)
