DIMACS and PACE Implementation challenges
There are two implementations challenges currently accepting submissions.
DIMACS
- Vehicle Routing
- CVRP - a simplest variant
- Generalized form of TSP
- TSP
- Input: n points with unique ids on xy plane
i xi y1
- Output: print a permutation of n
- Goal: Minimizing the distance travelled from first point to all others point and back to first.
- Input: n points with unique ids on xy plane
PACE
- Cluster Editing