1. Auslender, A.: Optimisation. Méthodes numériques. Masson, Paris 1976.
2. Balas, E.: Intersection cuts. An new type of cutting plane for integer programming. Oper. Res. 19 (1971), 19–39.
3. Balas, E. and Burdet, C. A.: Maximizing a convex quadratic function subject to linear constraints. Management Science Report N. 299, GSIA Carnegie-Mellon University, Pittsburgh, PA (1973).
4. Benacer, R. and Pham Dinh Tao: Etude de certains algorithmes pour la résolution d’une classe de problèmes d’optimisation non convexe. Journées de Fermât, Mathématiques pour l’optimisation, 6–10 ( 1985 ), Toulouse, Mai 1985.
5. Benacer, R. and Pham Dinh Tao: Linear programs with reverse convex constraints. Submitted to Math. Programming (1985).