This a rudimentary, stepwise viewer for a selection of heuristics to approximate the Travelling Salesperson Problem (TSP).

If you are running Linux and have an X server installed (probably true, XWayland does also work), it is easiest to use the provided docker container:

docker-compose build
# this is needed to allow access to zour X-server from within the Docker container
xhost +local:
docker-compose up

However, LP solving is disabled, since I can not ship the CPLEX library.

• Python 3
• PyQt 5
• Concorde (optional, for optimal tours)
• boost::python (optional, for LP & Cutting Planes)
• CPLEX (optional, for LP & Cutting Planes)