Quatrain of Traveling Salesman Problem - 1444

Quatrain of Traveling Salesman Problem

Traveling Salesman Problem in
mathematics - optimization problem

A graph problem, where the cities
of a graph are connected by the
weight of an edge so
charted,

O, thy traveling salesman, go find
a path to visit a city and return
to the city whence you
started.

Alas! Find the shortest distance
where the time grows exponentially
with each trip you
take,

You will find no known polynomial
will satisfy your longing and you
will sour from your
mistake!

Yorktown Disciple
1997