M. Jünger and S. Thienel: " Basic Design Ideas for the Branch-and-Cut System ABACUS", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-037-96]
M. Jünger and S. Thienel: " Implementation of ABACUS: A Branch-and-Bound algorithm for MIPs", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-061-96]
S. Thienel: " A Simple TSP Solver: An ABACUS Tutorial", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-099-96]
S. Thienel: " ABACUS 1.2 User's Guide and Reference Manual", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-100-96]
M. Jünger and V. Kaibel: " A Basic Study of the QAP-Polytope", 1996
WP(s): 3.2, responsible site: Cologne
Download report
[TR-101-96]
C. De Simone M. Diehl M. Jünger P. Mutzel G. Reinelt and G. Rinaldi: " Exact Ground States of Two-Dimensional $\pm$J Ising Spin Glasses", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-102-96]
C. De Simone and M. Jünger: " On the Two-Connected Planar Spanning Subgraph Polytope", 1996
WP(s): 1.2, responsible site: Cologne
Download report
[TR-103-96]
M. Jünger and V. Kaibel: " On the SQAP-Polytope", 1996
WP(s): 3.2, responsible site: Cologne
Download report
[TR-104-96]
S. Leipert: " The Tree Interface - Version 1.0 User Manual", 1996
WP(s): 1.3, responsible site: Cologne
Download report
[TR-105-96]
M. Jünger and P. Mutzel: " Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization", 1996
WP(s): 1.2, responsible site: Cologne
Download report
[TR-106-96]
T. Christof M. Jünger J. Kececioglu P. Mutzel and G. Reinelt: " A branch-and-cut approach to physical mapping with end-probes", 1996
WP(s): 3.2, responsible site: Cologne
Download report
[TR-143-97]
M. Jünger and S. Thienel: " Introduction to ABACUS - A Branch-And-CUt System", 1997
WP(s): 1.3, responsible site: Cologne
Download report
[TR-144-97]
M. Jünger and S. Thienel: " The Design of the Branch-and-Cut System ABACUS", 1997
WP(s): 1.3, responsible site: Cologne
Download report
[TR-168-97]
M. Jünger G. Rinaldi and S. Thienel: " Practical Performance of Efficient Minimum Cut Algorithms", 1997
WP(s): 3.2, responsible site: Cologne
Download report
[TR-243-97]
M. Jünger and V. Kaibel: " Box-Inequalities for Quadratic Assignment Polytopes", 1997
WP(s): 1.3, responsible site: Cologne
Download report
[TR-244-97]
M. Jünger and V. Kaibel: " The QAP-Polytope and the Star-Transformation", 1997
WP(s): 1.3, responsible site: Cologne
Download report
[TR-245-97]
M. Jünger G. Reinelt and G. Rinaldi: " The Traveling Salesman Problem", 1997
WP(s): 1.3, responsible site: Cologne
Download report
[TR-246-97]
M. Jünger S. Leipert and P. Mutzel: " Pitfalls of using PQ-Trees in Automatic Graph Drawing", 1997
WP(s): 1.2, responsible site: Cologne
Download report
[TR-310-98]
M. Jünger and G. Rinaldi: " Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States", 1998
WP(s): 3.2, responsible site: Cologne
Download report
[TR-311-98]
M. Jünger G. Rinaldi and S. Thienel: " Practical Performance of Efficient Minimum Cut Algorithms (revised)", 1998
WP(s): 3.2, responsible site: Cologne
Download report
[TR-357-98]
M. Jünger and S. Thienel: " The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization", 1998
WP(s): 1.3, responsible site: Cologne
Download report
[TR-460-99]
M. Jünger S. Leipert and P. Mutzel: " A Note on Computing a Maximal Planar Subgraph using PQ-Trees", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-461-99]
M. Jünger S. Leipert and P. Mutzel: " Level Planarity Testing in Linear Time", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-462-99]
N. Ascheuer M. Jünger and G. Reinelt: " A Branch-and-Cut Algorithm for the Asymmetric Hamiltonian Path Problem with Precedence Constraints", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-463-99]
V. Kaibel and M. Wolff: " Simple 0/1-Polytope", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-464-99]
T. Fleiner V. Kaibel and G. Rote: " Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-465-99]
E. Dahlhaus: " An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-466-99]
E. Dahlhaus: " Minimal Elimination Ordering for Graphs of Bounded Degree", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-467-99]
E. Dahlhaus: " Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs", 1999
WP(s): 3.2, responsible site: Cologne
Download report
[TR-468-99]
E. Dahlhaus: " Minimal Elimination Ordering Inside a Given Chordal Graph", 1999
WP(s): 3.2, responsible site: Cologne
Download report
![[logo ALCOM-IT]](../images/minilogo.gif)
