Items where Author or Editor is "Thienel, Stefan"
![]() | Up a level |
Article
Naddef, Denis and Thienel, Stefan
(2002)
Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem I: General Tools and Comb Separation.
Published in:
Mathematical programming : Series A Vol. 92 (2).
pp. 237-255.
Naddef, Denis and Thienel, Stefan
(2002)
Efficient Separation Routines for the Symmetric Traveling Salesman -- Problem II: Separating multi Handle Inequalities.
Published in:
Mathematical programming : Series A Vol. 92 (2).
pp. 257-283.
Jünger, Michael and Thienel, Stefan
(2000)
The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization.
Published in:
Software: Practice and Experience Vol. 30 (11).
pp. 1325-1352.
Jünger, Michael and Rinaldi, Giovanni and Thienel, Stefan
(2000)
Practical Performance of Efficient Minimum Cut Algorithms.
Published in:
Algorithmica Vol. 26 (1).
pp. 172-195.
Jünger, Michael and Thienel, Stefan
(1998)
Introduction to ABACUS - A branch-and-cut System.
Published in:
Operations Research Letters Vol. 22 (2-3).
pp. 83-95.
Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan
(1994)
Provably good solutions for the traveling salesman problem.
Published in:
Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research Vol. 40 (2).
pp. 183-217.
Collection Item
Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan
(1995)
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization.
Published in:
Combinatorial optimization : papers from the DIMACS special year ; [contains refereed papers from workshops held at DIMACS during the period of September 1992 through August 1993]., DIMACS series in discrete mathematics and theoretical computer science. 20 American Math. Soc 1995, pp. 111-152.
Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan
(1995)
Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization.
Published in:
Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization., DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences. American Mathematical Society 1995, pp. 111-152.
Paper
Thienel, Stefan
(1997)
ABACUS - A Branch-And-CUt System, Version 2.0, User's Guide and Reference Manual.
Manual
, 350 p.
Thienel, Stefan and Jünger, Michael
(1997)
The Design of the Branch-and-Cut System ABACUS.
Technical Report
, 30 p.
Thienel, Stefan
(1996)
ABACUS - A Branch-And-CUt System, Version 1.2, User's Guide and Reference Manual.
Technical Report
p.
Thienel, Stefan
(1996)
A Simple TSP-Solver: An ABACUS Tutorial.
Technical Report
, 34 p.
Jünger, Michael and Kaibel, Volker and Thienel, Stefan
(1994)
Computing Delaunay-Triangulations in Manhatten and Maximum Metric.
Technical Report
, 27 p.
Jünger, Michael and Kaibel, Volker and Thienel, Stefan
(1994)
A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric.
Technical Report
, 25 p.