 | Up a level |
Jünger, Michael, Kaibel, Volker and Thienel, Stefan
(1994).
Computing Delaunay-Triangulations in Manhatten and Maximum Metric.
["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Kaibel, Volker and Thienel, Stefan (1994). A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric. ["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Reinelt, Gerhard and Thienel, Stefan
(1995).
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization.
American Math. Soc.
["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Reinelt, Gerhard 
ORCID: 0000-0002-7193-501X and Thienel, Stefan
(1994).
Provably good solutions for the traveling salesman problem.
Physica-Verl..
["eprint_fieldopt_monograph_type_preprint" not defined].
Jünger, Michael, Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 and Thienel, Stefan
(2000).
Practical Performance of Efficient Minimum Cut Algorithms.
Algorithmica, 26 (1).
pp. 172-195.
Springer.
Jünger, Michael and Thienel, Stefan
(1998).
Introduction to ABACUS - A branch-and-cut System.
Operations Research Letters, 22 (2-3).
pp. 83-95.
Elsevier.
Thienel, Stefan
(1997).
ABACUS - A Branch-And-CUt System, Version 2.0, User's Guide and Reference Manual.
Documentation.
Thienel, Stefan
(1996).
A Simple TSP-Solver: An ABACUS Tutorial.
Working Paper.