On the separability of subproblems in benders decompositions

Annals of Operations Research

Volumn 171, Issue 1, 2009, Pages 27-43

  Cadoli, Marco ^a   Patrizi, Fabio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Benders decomposition; Constraint programming; Problem separation

Indexed keywords

EID: 70350344791     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0383-5     Document Type: Article

References (18)

1. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238-252.
2. Börger, E., Gräedel, E., & Gurevich, Y. (1997). The classical decision problem. Perspectives in mathematical logic. Berlin: Springer.
3. Cadoli, M., Mancini, T., Micaletto, D., & Patrizi, F. (2006). Evaluating ASP and commercial solvers on the CSPLib. In Proceedings of the seventeenth European conference on artificial intelligence (ECAI 2006).
4. Cambazard, H., & Jussien, N. (2005). Integrating Benders decomposition within constraint programming. In Lecture notes in artificial intelligence: Vol. 3709. Proceedings of the eleventh international conference on principles and practice of constraint programming (CP 2005) (pp.752-756). Berlin: Springer.
5. Dechter, R. (2003). Constraint processing. San Mateo: Morgan Kaufmann.
6. Fagin, R.(1974).Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp(Ed.), Complexity of computation (pp. 43-74).Providence: Am. Math. Soc.
7. Hooker, J. (2000). Logic-based methods for optimization: combining optimization and constraint satisfaction (Chap. 19, pp. 389-422). New York: Wiley.
8. Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96, 33-60.
9. Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing, 13, 258-276.
10. Lau, K. F., & Dill, K. A. (1989). A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules, 22, 3986-3997.
11. Lenzerini, M. (2002). Data integration: A theoretical perspective. In Proceedings of the twentyfirst ACM SIGACT SIGMOD SIGART symposium on principles of database systems (PODS 2002) (pp. 233-246).
12. Papadimitriou, C. H. (1994). Computational complexity. Reading, MA: Addison Wesley.
13. Puget, J. F. (1998). A fast algorithm for the bound consistency of alldiff constraints. In Proceedings of the fifteenth national conference on artificial intelligence (AAAI'98)(pp. 359-366).
14. Quaife, A. (1992). Automated development of fundamental mathematical theories. Dordrecht: Kluwer Academic.
15. Smith, B. M., Stergiou, K., & Walsh, T. (2000). Using auxiliary variables and implied constraints to model non-binary problems. In AAAI/IAAI (pp. 182-187).
16. van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge: MIT Press.
17. Walsh, T. (2001). Permutation problems and channelling constraints. In Lecture notes in computer science: Vol. 2250. Proceedings of the eighth international conference on logic for programming, artificial intelligence and reasoning (LPAR 2001) (pp. 377-391). Berlin: Springer.
18. Wos, L. (1996). The automation of reasoning: An experimenter notebook with OTTER tutorial. San Diego: Academic Press.