1. E. Balas, S. Ceria, and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming, 58:295–324, 1993.
2. E. Balas, S. Ceria, and G. Cornuéjols. Solving mixed 0–1 programs by a lift-and-project method. In Symposium on Discrete Algorithms, SODA, Austin, Texas ACM-SIAM, 1993.
3. P. Barth. A complete symbolic 0–1 constraint solver. In 3rd Workshop on Constraint Logic Programming, WCLP'93, Marseille, March 1993.
4. P. Barth. Linear 0–1 inequalities and extended clauses. In Logic Programming and Automated Reasoning, LPAR'93, St. Petersburg, Springer, LNCS 698, 1993.
5. P. Barth. Linear 0–1 inequalities and extended clauses. Technical Report MPI-I-94–216, Max-Planck-Institut für Informatik, Saarbrücken, April 1994.