d-krupke/close-enough-tsp
A Branch&Bound-based solver for the close-enough TSP, optimized as subroutine for coverage path planning.
Jupyter Notebook
Issues
- 0
``ChFarthestCircle`` doesn't do anything?!
#18 opened by d-krupke - 0
- 1
Update setup.py for conan 2.0
#16 opened by d-krupke - 1
Make Gurobi auto-install or at least provide detailed instructions on how to install it.
#17 opened by d-krupke - 0
Set up documentation for Python part
#14 opened by d-krupke - 0
Set up documentation for C++-part
#13 opened by d-krupke - 0
Add pure trajectory upper bounds again?
#12 opened by d-krupke - 3
- 1
Path Convex Hull seems to be buggy.
#8 opened by d-krupke - 1
- 4
Idea: Extend Convex Hull Idea
#2 opened by d-krupke - 1
- 2
- 0
Maybe we can say something if two adjecent circles in a sequence are intersecting?
#6 opened by d-krupke - 2
Revisiting Crossing Free
#5 opened by d-krupke