Giters

JayTee42 / tsp

An implementation of the Held-Karp dynamic programming algorithm to solve the Traveling Salesman Problem

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

tsp

An implementation of the Held-Karp dynamic programming algorithm to solve the Traveling Salesman Problem

  • Parallelization via OpenMP (see Makefile)
  • Linux (e. g. pacman -S openmp) and macOS (brew install llvm)
  • ACTUAL_N is the number of vertices to incorporate. Adapt your dist_matrix accordingly.

On my machines, 28 vertices are processed in 1:20 to 1:30 mins with < 8 GB memory usage.

About

An implementation of the Held-Karp dynamic programming algorithm to solve the Traveling Salesman Problem

License:MIT License

Languages

Language:C 90.1%Language:CMake 3.6%Language:Makefile 3.3%Language:Dockerfile 3.1%