[Home]Traveling salesman problem

HomePage | Recent Changes | Preferences

Showing revision 2
The <b>traveling salesman problem</i> is a prominent illustration of a class of problems in complexity theory. See Sharp-P.

An [approximative solution] for 1512 cities in Germany was found 2001 by the Princeton University.


HomePage | Recent Changes | Preferences
This page is read-only | View other revisions | View current revision
Edited December 6, 2001 7:03 am by 62.202.117.xxx (diff)
Search: