Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
From MaRDI portal
Publication:3115997
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
Cited in
(9)- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
- Stochastic set packing problem
- Structuring bilateral energy contract portfolios in competitive markets
- Robust network design with uncertain outsourcing cost
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
- Multi-service multi-facility network design under uncertainty
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
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)
