The traveling salesman problem (dynamic programming): pages 173-175, the DPV textbook (in
Section 6.6).

A1 solutions.