Stefan Thienel

From MaRDI portal
(Redirected from Stefan Thienel)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization2003-01-23Paper
Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
Mathematical Programming. Series A. Series B
2002-09-15Paper
Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
Mathematical Programming. Series A. Series B
2002-08-20Paper
Practical performance of efficient minimum cut algorithms
Algorithmica
2000-03-19Paper
Introduction to ABACUS -- a branch-and-cut system
Operations Research Letters
1998-11-15Paper
scientific article; zbMATH DE number 780782 (Why is no real title available?)1996-04-28Paper
Provably good solutions for the traveling salesman problem
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research
1995-06-25Paper


Research outcomes over time


This page was built for person: Stefan Thienel