A hybrid Benders' decomposition method for solving stochastic constraint programs with linear recourse

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3978 LNAI, Issue , 2006, Pages 133-148

  Tarim, S Armagan ^a   Miguel, Ian ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SOFTWARE; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PROBLEM SOLVING;

BENDERS' DECOMPOSITION ALGORITHM; DECISION VARIABLES; LINEAR RECOURSE ACTIONS; STOCHASTIC CONSTRAINT PROGRAMS (SCPS);

CONSTRAINT THEORY;

EID: 33746610095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11754602_10     Document Type: Conference Paper

References (17)

1. Beasley, J.E.: An algorithm for solving large capacitated warehouse location problems. European Journal of Operational Research, 33 (1988) 314-325
2. Benders, J. F.: Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik, 4 (1962) 238-252
3. Benoist, T., Gaudin, E., Rottembourg, B.: Constraint Programming Contribution to Benders Decomposition: A Case Study, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, LNCS 2470 (2002) 603-617
4. Eremin, A., Wallace, M.: Hybrid Benders Decomposition Algorithms in Constraint Logic Programming, Principles and Practice of Constraint Programming, Proceedings of the 7th International Conference, CP 2001, Paphos, Cyprus, LNCS 2239 (2001) 1-15
5. Geoffrion, A. M.: Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10 (1972) 237-260
6. Holmberg, K., Ronnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problem with single sourcing. European Journal of Operational Research, 113 (1999) 544-559
7. Hooker, J. N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming, 96 (2003) 33-60
8. ILOG Inc.: OPL Studio 3.7, Studio Users Manual, (2003)
9. Jain, V., Grossmann, I. E.: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems. INFORMS Journal on Computing, 13 (2001) 258-276
10. Khumawala, B. M.: An Efficient Branch-Bound Algorithm for the Warehouse Location Problem, Management Science. 18 (1972) 718-731
11. Krarup, J., Pruzan, P. M.: The simple plant location problem: Survey and synthesis. European Journal of Operational Research. 12 (1983) 36-81
12. Manandhar, S., Tarim, S. A., Walsh. T.: Scenario-Based Stochastic Constraint Programming. Proceedings of IJCAI-2003, Acapulco, Mexico. (2003) 257-262
13. Mirchandani, P. B., Francis, R. L.: Discrete Location Theory, John Wiley and Sons, (1990)
14. Proll, L., Smith, B.M. Integer linear programming and constraint programming approaches to a template design problem. INFORMS Journal on Computing 10(3):265-275, 1998.
15. Tarim, S. A., Manandhar, S., Walsh. T.: Stochastic Constraint Programming: A Scenario-Based Approach, Constraints 11(1), 2006.
16. Thorsteinsson, E. S.: Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. Principles and Practice of Constraint Programming, Proceedings of the 7th International Conference, CP 2001, LNCS 2239 (2001) 16-30
17. Xia, Q., Eremin, A., Wallace. M.: Problem Decomposition for Traffic Diversions. Proceedings of the 1st International Conference, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, LNCS 3011 (2004) 348-363