(M)ILP-based solutions for common CS / Graph Theory problems in C, C++, and Python. Sometimes non-milp approximation algorithms are provided.
- Set Cover
- Hitting Set
- TSP
- K-TSP
- TSP+N
- K-TSP+N
- Min-Sum Assignment (Hungarian Problem)
- CVR / CMVR
- Orienteering
- K-Orienteering