Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2007
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2007

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

Search the Archive

An extension of the traveling salesman problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg75433] An extension of the traveling salesman problem
  • From: Virgil Stokes <vs at it.uu.se>
  • Date: Mon, 30 Apr 2007 03:42:00 -0400 (EDT)

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