Basic HTML version of Foils prepared 15 March 1996

Foil 19 TSP or Travelling Salesperson Problem
Classic NP-complete discrete optimization problem

From Physical Optimization and Physical Computation CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
1 Can be viewed as constrained clustering which approach "derives" elastic net from deterministic annealing
in Table To:

Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998