B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
From MaRDI portal
Publication:817201
DOI10.1007/s10479-005-3967-3zbMath1091.90007OpenAlexW2089185195MaRDI QIDQ817201
Gérard Plateau, Nelson F. Maculan, Rafael Andrade, Abdel Lisser
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3967-3
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Stochastic programming (90C15) Deterministic network models in operations research (90B10) Boolean programming (90C09)
Related Items
On the enrouting protocol problem under uncertainty, Tree network design avoiding congestion, Multi-service multi-facility network design under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Telecommunication network capacity design for uncertain demand
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- A branch and bound method for stochastic global optimization
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- On Optimal Allocation of Indivisibles Under Uncertainty
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- Introduction to Stochastic Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- A disjunctive cutting plane procedure for general mixed-integer linear programs
