Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models

References

• Ahmed S., Tawarmalani M., Sahinidis N. V. A finite branch and bound algorithm for two-stage stochastic integer programs. Math. Programming (2004) 99:109–126Crossref, Google Scholar
• Andrade R., Lisser A., Maculan N., Plateau G. Telecommunication network capacity design for uncertain demand. Comput. Optim. Appl. (2004) 29:127–146Crossref, Google Scholar
• Andrade R., Lisser A., Maculan N., Plateau G. B&B Frameworks for the capacity expansion of high speed telecommunication networks under uncertainty. Ann. Oper. Res. (2005) 140(1):49–65Crossref, Google Scholar
• Carøe C. C., Schultz R. Dual decomposition in stochastic integer programming. Oper. Res. Lett. (1999) 24:37–45Crossref, Google Scholar
• CPLEX 6.5User's Manual (1999) . ILOG CPLEX Division, FranceGoogle Scholar
• Gaivoronski A., Sciomachen A. Stochastic programming approach to the network planning under uncertainty. Optimization in Industry 3: Mathematical Programming and Modeling Techniques in Practice (1995) (Wiley and Sons, Chichester, UK) 145–163Google Scholar
• Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142Crossref, Google Scholar
• Norkin V. I., Ermoliev Yu. M., Ruszczyński A. On optimal allocation of indivisibles under uncertainty. Oper. Res. (1998a) 46(3):381–395Link, Google Scholar
• Norkin V. I., Pflug G. Ch., Ruszczyński A. A branch and bound method for stoch. global optimization. Math. Programming (1998b) 83:425–450Crossref, Google Scholar
• Sen S., Doverspike R. D., Cosares S. Network planning with random demand. Telecomm. Systems (1994) 3:11–30Crossref, Google Scholar