Bibliography

[JG99] Jain, V. and Grossmann, I.E.: Algorithms for hybrid MILP/CLP models for a class of optimization problems. INFORMS J. Computing, 13(4):258—276, 2001.

[BP03] Bockmayr, A. and Pisaruk, N.: Detecting Infeasibility and Generating Cuts for MIP Using CP. In Proceedings of CP-AI-OR 2003, pages 24—34. Montreal, 2003.

[Sad04] Sadykov, R.: A Hybrid Branch-and-Cut Algorithm for the One-Machine Scheduling Problem. In Régin, J.C. and Rueher, M., ed., Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2004, pages 409—414. Springer, Berlin, 2004.

[Tim02] Timpe, C.: Solving planning and scheduling problems with combined integer and constraint programming. ORSpectrum, 24(4):431—448, 2002.