Getting Started
User Guide
API Reference
Project
Defined in File Problems.h
certificatoTsp(): the tour P, a permutation, is at most k long; the empty tour of no city is 0 long
D is square