1. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58, 295–324 (1993)
2. Beale, E.M.L.: Branch and bound methods for mathematical programming systems. Annals of Discrete Mathematics 5, 201–219 (1979)
3. Beale, E.M.L., Forrest, J.J.H.: Global optimization using special ordered sets. Mathematical Programming 10, 52–69 (1976)
4. Beale, E.L.M., Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence J. (ed) Proceedings of the fifth international conference on operations research. Tavistock Publications, London, 1970, pp 447–454
5. Christof, T., Löbel, A.: PORTA: POlyhedron Representation Transformation Algorithm, Version 1.3. Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2000