B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty

DOI10.1007/S10479-005-3967-3MaRDI QIDQ817201zbMATH OpenOpenAlexFDO

Authors Gérard Plateau, Rafael Andrade, Abdel Lisser, Nelson Maculan

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

zbMATH Keywords

branch and boundnetwork designstochastic integer programminginteger L-shaped decomposition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Stochastic programming (90C15) Integer programming (90C10) Communication networks in operations research (90B18) Boolean programming (90C09)

Recommendations

• Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
• Capacitated network design with uncertain demand
• A bicriteria stochastic programming model for capacity expansion in telecommunications
• Robust network design: formulations, valid inequalities, and computations
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

Cites work

• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 1086913 (Why is no real title available?)
• A branch and bound method for stochastic global optimization
• A cutting-plane approach to mixed 0-1 stochastic integer programs
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• Dual decomposition in stochastic integer programming
• Introduction to Stochastic Programming
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• On optimal allocation of indivisibles under uncertainty
• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
• Telecommunication network capacity design for uncertain demand
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(6)

• Multi-service multi-facility network design under uncertainty
• Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models
• On the enrouting protocol problem under uncertainty
• Tree network design avoiding congestion
• A bicriteria stochastic programming model for capacity expansion in telecommunications
• Multiperiod capacity expansion of a telecommunications connection with uncertain demand

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty

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