B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty
R. Andrade,
A. Lisser (),
N. Maculan and
G. Plateau
Annals of Operations Research, 2005, vol. 140, issue 1, 49-65
Abstract:
The purpose of this paper is to investigate branch and bound strategies and the comparison of branch and cut with pure branch and bound approaches on high speed telecommunication network design under uncertainty. We model the problem as a two-stage stochastic program with discrete first-stage (investment) variables. Two formulations of the problem are used. The first one with general integer investment variables and the second one, a variant of the first model, with 0-1 investment variables. We present computational results for three solution approaches: the integer L-shaped (Benders) decomposition, a branch and bound framework and a disjunctive cutting plane method. Copyright Springer Science + Business Media, Inc. 2005
Keywords: stochastic integer programming; integer L-shaped decomposition; branch and bound; network design (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-3967-3 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:140:y:2005:i:1:p:49-65:10.1007/s10479-005-3967-3
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-005-3967-3
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().