Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models

Management Science

Volumn 52, Issue 9, 2006, Pages 1450-1455

  Andrade, Rafael ^a   Lisser, Abdel ^a   Maculan, Nelson ^b   Plateau, Gérard ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

B B strategies; Network design under uncertainty; Stochastic integer programming

Indexed keywords

B FRAMEWORK; B TREES; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL RESULTS; FEASIBLE SOLUTION; FIXED CHARGES; INTEGRALITY CONSTRAINTS; L-SHAPED; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; NETWORK DESIGN UNDER UNCERTAINTY; OPTIMALITY CUTS; RANDOM DEMAND; STOCHASTIC INTEGER PROGRAMMING; SUBGRADIENT; TWO STAGE; VALID INEQUALITY;

ALGORITHMS; DESIGN; DYNAMIC PROGRAMMING; STOCHASTIC MODELS; SYSTEMS ANALYSIS;

INTEGER PROGRAMMING;

EID: 67349212998     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0536     Document Type: Article

References (10)

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