1. Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Cutting planes from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer and Combinatorial Optimization, pp. 30–42. Springer, Heidelberg (2007)
2. Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Operations Research 19, 19–39 (1971)
3. Borozan, V., Cornuéjols, G.: Minimal inequalities for integer constraints (2007), http://integer.tepper.cmu.edu
4. Cook, W.J., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Mathematical Programming 58, 155–174 (1990)
5. Cornuéjols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints (2007), http://wpweb2.tepper.cmu.edu/fmargot/rec_pub.html