B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
type: Item
instance of: scholarly article
title: B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
zbMATH Open document ID: 1091.90007
author: Gérard Plateau
author: Rafael Andrade
author: Abdel Lisser
author: Nelson Maculan
published in: Annals of Operations Research
publication date: 2006-03-07T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5009780
zbMATH Keywords: stochastic integer programming
zbMATH Keywords: integer L-shaped decomposition
zbMATH Keywords: branch and bound
zbMATH Keywords: network design
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10479-005-3967-3
OpenAlex ID: W2089185195
cites work: A finite branch-and-bound algorithm for two-stage stochastic integer programs
cites work: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
cites work: Telecommunication network capacity design for uncertain demand
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Introduction to Stochastic Programming
cites work: Dual decomposition in stochastic integer programming
cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse
cites work: A cutting-plane approach to mixed 0-1 stochastic integer programs
cites work: Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
cites work: Q4363169
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Q3738922
cites work: On optimal allocation of indivisibles under uncertainty
cites work: A branch and bound method for stochastic global optimization
cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs
cites work: Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
DOI: 10.1007/S10479-005-3967-3
description: scientific article; zbMATH DE number 5009780