A C++ library for computing triangulation and Traveling Saleseman Problem approximations
-
Updated
Jan 9, 2019 - C++
A C++ library for computing triangulation and Traveling Saleseman Problem approximations
Datasets related to the paper: "Improving the efficiency of Euclidean TSP solving in Constraint Programming by predicting effective nocrossing constraints" (Elena Bellodi, Alessandro Bertagnon, Marco Gavanelli, Riccardo Zese). AIxIA 2020, Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence (LNAI, volume 12414).
Add a description, image, and links to the euclidean-tsp topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-tsp topic, visit your repo's landing page and select "manage topics."