Integrating benders decomposition within constraint programming

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

Volumn 3709 LNCS, Issue , 2005, Pages 752-756

  Cambazard, Hadrien ^a   Jussien, Narendra ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646172804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_58     Document Type: Conference Paper

References (8)

1. J. F. Benders. Partitionning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238-252, 1962.
2. A. M. Geoffrion. Generalized Benders Decomposition. Journal of Optimization Theory And Practice, Vol. 10, No. 4, 1972.
3. J.N. Hooker and G. Ottosson. Logic-based benders decomposition. Mathematical Programming, 96:33-60, 2003.
4. Vipul Jain and I. E. Grossmann. Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing, 13:258-276, 2001.
5. Erlendur S. Thorsteinsson. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In CP'01, 2001.
6. John N. Hooker A Hybrid Method for Planning and Scheduling. In CP'04, pages 305-316, 2004.
7. T. Benoist, E. Gaudin, and B. Rottembourg. Constraint programming contribution to benders decomposition: A case study. In CP'02, pages 603-617, 2002.
8. H. Cambazard, P. E. Hladik, A. M. Déplanche, N. Jussien, and Y. Trinquet. Decomposition and learning for a real time task allocation problem. In CP'04, pages 153-167, 2004.