Next: Examples -- II
Up: COMPUTATIONAL SCIENCE SIMULATION
Previous: Abstract of Optimization
Travelling Salesman Problem
- Let

- Minimize

This is a (NP Complete) Discrete Variables example. The concept of NP
completeness, discussed in detail by computer science, appears of
little practical significance.
Geoffrey Fox, Northeast Parallel Architectures Center at Syracuse University, gcf@npac.syr.edu