Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)45 55 43 4C 49 44 45 41 4E 54 52 41 56 45 4C 49 4E 47 53 41 4C 45 53 4D 41 4E 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000101 01010101 01000011 01001100 01001001 01000100 01000101 01000001 01001110 00100000 01010100 01010010 01000001 01010110 01000101 01001100 01001001 01001110 01000111 00100000 01010011 01000001 01001100 01000101 01010011 01001101 01000001 01001110 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)E U C L I D E A N   T R A V E L I N G   S A L E S M A N   P R O B L E M |
ISO 10646 (1991-1993) (references)0045 0055 0043 004C 0049 0044 0045 0041 004E 0054 0052 0041 0056 0045 004C 0049 004E 0047 0053 0041 004C 0045 0053 004D 0041 004E 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)395537464338393548254523556394643484125335463953473548250524936463947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
