Data Ordering Problem with Inversion (Informaticup 2008)

zurück/back to home

In 2009, I participated in the Informaticup 2008 with Daniel Karch and Jochen Seidel. We worked on the problem ``Data Ordering Problem with Inversion''. The key idea of our solution is a reduction to ``Minimal Weighted Hamiltonian Path'' which is very similar to the ``Traveling Salesman Problem''.

Below, you can find the C++ source code with Ubuntu intrepid and Mac Os X 10.5 binaries. The UI is for Mac Os X. The software is free for personal and research use. The source code and comments is in English, the documentation is in German.

Resources

Links