University of Cologne

Faculty of Mathematics and Natural Sciences
Computer Science Department - Prof. Dr. Michael Jünger

Navigation: Software

Software

Abstract:

GEODUAL is a software for creating and solving geometric instances of the Minimum Spanning Tree problem, the Perfect Matching problem, and the Traveling Salesman problem, along with visual proofs of optimality.

People involved:

M. JüngerM. Schulz, M. Gronemann, W.Zychowicz

Abstract:

ABACUS is a software system which provides a framework for the implementation of branch-and-bound algorithms using linear programming relaxations that can be complemented with the dynamic generation of cutting planes or columns (branch-and-cut, branch-and-price, branch-and-cut-and-price).

People involved:

M. Böhm, T. Christof, M. Elf, C. Gutwenger, M. Jünger, T. Lange, S.Leipert, S. Mallach, G. Reinelt, D. Schmidt, S. Thienel

Abstract:

OGDF, an open source C++ library of Algorithms for Graph Drawing, offers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms.

People involved:

M. Chimani, M. Gronemann, C. Gutwenger, M. Jünger, K. Klein, P. Mutzel, M. Schulz, C. Spisla

Abstract:

FAI is an automated system to install a Debian GNU/Linux operating system on a Linux Cluster without any interaction necessary.

People involved:

T. Lange

Abstract:

We compute exact ground states of your spin glass samples: You can send a two- or three-dimensional instance to our server address. The result will be sent back to you.

People involved:

M. Diehl, M. Jünger, T. Lange, F. Liers

Abstract:

The Tree Interface is a graphical tool specially designed to draw binary and general rooted trees. An interesting application is the VBCTool that visualizes the progress of a Branch-and-Cut algorithm.

People involved:

Martin Diehl, Michael Jünger, Joachim Kupke, and Sebastian Leipert