no code implementations • 10 Feb 2018 • Krishnendu Chatterjee, Laurent Doyen
A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon $T$.
Traveling Salesman Problem