This is the most useful generic models in the field of combinatorial optimization. The problem seeks a minimum cost (total distance) tour (closed path) that includes each of a given set of points.
Please be advised that external sites may have terms and conditions,
including license rights, that differ from ours. MIT OCW is not responsible
for any content on third party sites, nor does a link suggest an endorsement
of those sites and/or their content.