In this assignment we can see an algorithmic implementation for solving the famous "Travelling Salesman Problem". This implementation uses a SAT reduction and solves it using a given SAT solver.
-
Updated
Dec 6, 2021 - Java
#
sat-reduction
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the sat-reduction topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sat-reduction topic, visit your repo's landing page and select "manage topics."