1. Show that, if there are no operational constraints, there always exists an optimal NRP solution in which a single vehicle is used (hint: least-cost path costs satisfy the triangle inequality).
2. Show that if the costs associated to the arcs of a complete directed graph G satisfy the triangle inequality property, then there exists in G' an ATSP optimal solution which is a Hamiltonian tour.