Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of materials, a greedy algorithm finds the optimum. Take as much as possible of the material that is most valuable per unit volume. If there is still room, take as much as possible of the next most valuable material. Continue until the knapsack is full. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)46 52 41 43 54 49 4F 4E 41 4C 4B 4E 41 50 53 41 43 4B 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000110 01010010 01000001 01000011 01010100 01001001 01001111 01001110 01000001 01001100 00100000 01001011 01001110 01000001 01010000 01010011 01000001 01000011 01001011 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)F R A C T I O N A L   K N A P S A C K   P R O B L E M |
ISO 10646 (1991-1993) (references)0046 0052 0041 0043 0054 0049 004F 004E 0041 004C 004B 004E 0041 0050 0053 0041 0043 004B 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)4052353754434948354624548355053353745250524936463947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
