Traveling Salesman

Your client runs same-day deliveries. Each morning the van leaves the depot, visits every client location exactly once, and returns to the depot. The city is full of one-way streets, so travel times are asymmetric: the table gives minutes from the row's location to the column's location, and A-to-B rarely equals B-to-A.

The depot is the first row. Produce the fastest full route as a list of location names, one per row of OUTPUT: the depot, every location in visiting order, and the depot again at the end. There is always exactly one fastest route. Up to seven locations total.