Stefan Thienel

According to our database, Stefan Thienel authored at least 8 papers between 1993 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities.

Denis Naddef, Stefan Thienel

Math. Program., 2002

Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation.

Denis Naddef, Stefan Thienel

Math. Program., 2002

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

Practical Performance of Efficient Minimum Cut Algorithms.

Michael Jünger, Giovanni Rinaldi, Stefan Thienel

Algorithmica, 2000

1998

Introduction to ABACUS - a branch-and-cut system.

Michael Jünger, Stefan Thienel

Oper. Res. Lett., 1998

1995

ABACUS - a branch-and-CUt system.

Stefan Thienel

PhD thesis, 1995

1994

Provably good solutions for the traveling salesman problem.

Michael Jünger, Stefan Thienel, Gerhard Reinelt

Math. Methods Oper. Res., 1994

1993

Practical problem solving with cutting plane algorithms in combinatorialoptimization.

Michael Jünger, Gerhard Reinelt, Stefan Thienel

Proceedings of the Combinatorial Optimization, 1993