Practical problem solving with cutting plane algorithms in combinatorialoptimization. - Michael Jünger; Gerhard Reinelt; Stefan Thienel (Combinatorial Optimization, 1993)

Provably good solutions for the traveling salesman problem. - Michael Jünger; Stefan Thienel; Gerhard Reinelt (Math. Methods Oper. Res., 1994)

ABACUS - a branch-and-CUt system. - Stefan Thienel (1995)

Introduction to ABACUS - a branch-and-cut system. - Michael Jünger; Stefan Thienel (Oper. Res. Lett., 1998)

Practical Performance of Efficient Minimum Cut Algorithms. - Michael Jünger; Giovanni Rinaldi; Stefan Thienel (Algorithmica, 2000)

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. - Michael Jünger; Stefan Thienel (Softw. Pract. Exp., 2000)

Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. - Denis Naddef; Stefan Thienel (Math. Program., 2002)

Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. - Denis Naddef; Stefan Thienel (Math. Program., 2002)