E. Balas/S. Ceria/G. Cornuejols: A lift-and-project cutting plane
algorithm for mixed 0/1 programs. Math. Programming 58 (1993), 295-324.

E. Balas/Jens Clausen (ed.): Proceedings of IPCO 4.
Springer LN CS 920 (1995).

M10290 Caterina De Simone: The cut polytope and the boolean quadric polytope.
Discrete Math. 79 (1989), 71-75.

10269 Christoph Helmberg: An interior point method for semidefinite
programming and max-cut bounds. Dissertation TU Graz 1994.

10260 Christoph Helmberg/Svatopluk Poljak/Franz Rendl/Henry Wolkowicz:
Combining semidefinite and polyhedral relaxations for integer programs.
Internet ca. 1995, 12p. [In Balas/Clausen 1995, 124-134.]

10273 Christoph Helmberg/Franz Rendl: Solving quadratic (0,1)-problems
by semidefinite programs and cutting planes.
Internet 1996, 22p.

10258 Christoph Helmberg/Franz Rendl/Robert Weismantel: Quadratic knapsack
relaxations using cutting planes and semidefinite programming.
Konrad-Zuse-Zentrum Berlin SC 95-37 (1995).

10253 Christoph Helmberg/Franz Rendl/Henry Wolkowicz/Robert Vanderbei:
An interior-point method for semidefinite programming.
TU Graz Report 264 (1994).

10333 Laszlo Lovasz: Semidefinite programming and combinatorial
optimization. Internet 1995, 20p.

10335 Svatopluk Poljak/Franz Rendl/Henry Wolkowicz: A recipe for
semidefinite relaxation for (0,1)-quadratic programming.
Internet 1992, 13p.

10291 Robert Weismantel: On the 0/1 knapsack polytope.
Konrad-Zuse-Zentrum Berlin SC 94-01 (1994).

10334 Henry Wolkowicz/Qing Zhao: Semidefinite programming relaxations
for the graph partitioning problem. Univ. Waterloo TR CORR 96-... (1996).

10324 Henry Wolkowicz/Qing Zhao: Semidefinite programming relaxations
for set partitioning problems.
Univ. Waterloo TR CORR 96-... (1996).

10323 Qing Zhao: Semidefinite programming for assignment and partitioning
problems. PhD thesis Univ. Waterloo 1996.

10254 Qing Zhao/Stefan Karisch/Franz Rendl/Henry Wolkowicz: Semidefinite
programming relaxations for the quadratic assignment problem.
J. Comb. Opt. ... (ca. 1997), ...