A Finite-diierence Algorithm for the Traveling Salesman Problem

  • Joel FranklinyDecember
  • Published 1997

Abstract

We develop an algorithm for the traveling salesman problem by applying nite diierences to a generating function. This algorithm requires polynomial space. In comparison, a dynamic programming algorithm requires exponential space. Also, the nite-diierence algorithm requires less space than a similar inclusion and exclusion algorithm. 

Topics

  • Presentations referencing similar topics