Thienel S.

S. Thienel

Information about the author S. Thienel will soon be added to the site.
Found 4 papers in total
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
Efficient separation routines for the symmetric travelling salesman problem I: General tools and comb separation
2002
This is the first of a series of two papers dedicated to efficient separation...
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
Efficient separation routines for the symmetric travelling salesman problem II: Separating multi handle inequalities
2002
This paper is the second in a series of two papers dedicated to the separation problem...
Introduction to ABACUS – a branch-and-cut system
Introduction to ABACUS – a branch-and-cut system
1998
The software system ABACUS is an object-oriented framework for the implementation of...
Provably good solutions for the traveling salesman problem
Provably good solutions for the traveling salesman problem
1994
The determination of true optimum solutions of combinatorial optimization problems is...
Papers per page: