MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

An extension of the traveling salesman problem


I am interested in a special form of the infamous "traveling salesman 
problem" (TSP). More specifically, the symmetric form, and the objective 
is to minimize the total time to visit a set of cities (each city can be 
visited only once). In addition, the time between cities increases as a 
monotonic function of the elapsed time.

Has anyone used Mathematica to look at this form of the TSP?

Thanks,
V. Stokes


  • Prev by Date: Loading packages from the internet?
  • Next by Date: Simplification
  • Previous by thread: Loading packages from the internet?
  • Next by thread: On the Form of information