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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahmed, S., M. Tawarmalani, and N.V. Sahinidis. (2004). “A Finite Branch and Bound Algorithm for Two-Stage Stochastic Integer Programs.” Mathematical Programming 100, 355–377.
Alonso-Ayuso, A., L.F. Escudero, and M.T. Ortuño. (2003). “BFC, A Branch-and-Fix Coordination Algorithmic Framework for Solving Some Types of Stochastic Pure and Mixed 0-1 Programs.” European Journal of Operational Research 151, 503–519.
Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2002a). “Simulation on Two-stage Stochastic Integer Programming Problems in Telecommunication Networks.” France Telecom R&D report NT/FTR&D/7595.
Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2004). “Telecommunication Network Capacity Design for Uncertain Demand.” Computational Optimization and Applications 29(2), 127-146.
Andrade, R., A. Lisser, N. Maculan, and G. Plateau. (2002b). “Planning Network Design Under Uncertainty with Fixed Charge.” France Telecom R&D report NT/FTR&D/7597.
Balas, E., S. Ceria, and G. Cornuéjols. (1996). “Mixed 0-1 Programming by Lift-And-Project in a Branch-and-Cut Framework.” Management Science 42(9), 1229–1246.
Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research, Berlin.
Carøe, C.C. and R. Schultz. (1999). “Dual Decomposition in Stochastic Integer Programming.” Operations Research Letters 24, 37–45.
Carøe, C.C. and J. Tind. (1998). “The L-Shaped Decomposition of Two-Stage Stochastic Programs with Integer Recourse.” Mathematical Programming 83, 451–464.
Carøe, C.C. and J. Tind. (1997). “A Cutting Plane Approach to Mixed 0-1 Stochastic Integer Programs.” European Journal of Operational Research 101(2), 306–316.
Chardaire, P. and A. Lisser. (2002). “Simplex and Interior Point Specialization Algorithms for Solving Non-Oriented Multicommodity Flow Problems.” Operations Research 50(2), 260–276.
CPLEX 6.5 User's Manual © (1999). ILOG CPLEX Division, France.
Fantauzzi, F., A. Gaivoronski, and E. Messina. (1997). “Decomposition Methods for Network Optimization Problems in the Presence of Uncertainty.” In P. Pardalos, D. Hearn and W. Hager (eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems 450, Springer, Berlin, pp. 234–248.
Hägglöf, K. (1996). “The Implementation of the Stochastic Branch and Bound Method for Applications in River Basin Water Quality Management.” IIASA Working Paper WP-96-89, Laxenburg, Austria.
Laporte, G. and F.V. Louveaux. (1993). “The Integer L-Shaped Method for Stochastic Integer Programs with Complete Recourse.” Operations Research Letters 13, 133-142.
Lee, E.V. and J.E. Mitchell. (2001). Branch-and-Bound Methods for Integer Programming. in the Encyclopedia of Optimization, Kluwer Academic Publishers.
Minoux, M. (1986). “Mathematical Programming: Theory and Algorithms.” Wiley-Interscience.
Norkin, V.I., Yu. M. Ermoliev, and A. Ruszczyński. (1998). “On Optimal Allocation of Indivisibles Under Uncertainty.” Operations Research 46(3), 381–395.
Norkin, V.I. G.Ch. Pflug, and A. Ruszczyński. (1998). “A Branch and Bound Method for Stochastic Global Optimization.” Mathematical Programming 83, 425–450.
Owen, J.H. and Mehrotra, S. (2001). “A Disjunctive Cutting Plane Procedure for General Mixed-Integer Linear Programs.” Math. Progr. 89, 437–448.
Schultz, R., L. Stougie, and M.H. van der Vlerk. (1998). “Solving Stochastic Programs with Integer Recourse by Enumeration: A Framework Using Gröbner Basis Reductions.” Math. Progr. 83, 229–252.
Sen, S., R.D. Doverspike, and S. Cosares. (1994). “Network Planning with Random Demand.” Telecommunication Systems 3, 11–30.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by France Telecom.
Rights and permissions
About this article
Cite this article
Andrade, R., Lisser, A., Maculan, N. et al. B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Ann Oper Res 140, 49–65 (2005). https://doi.org/10.1007/s10479-005-3967-3
Issue Date:
DOI: https://doi.org/10.1007/s10479-005-3967-3