Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Math | A maximum-flow problem involving multiple commodities, in which each commodity has an associated demand and source-sink pairs. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: MULTI-COMMODITY FLOW |
| Specialty definitions using "MULTI-COMMODITY FLOW": concurrent flow ♦ integer multi-commodity flow. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)4D 55 4C 54 49 2D 43 4F 4D 4D 4F 44 49 54 59      46 4C 4F 57 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001101 01010101 01001100 01010100 01001001 00101101 01000011 01001111 01001101 01001101 01001111 01000100 01001001 01010100 01011001 00100000 01000110 01001100 01001111 01010111 |
HTML Code (1990) (references)M U L T I - C O M M O D I T Y   F L O W |
ISO 10646 (1991-1993) (references)004D 0055 004C 0054 0049 002D 0043 004F 004D 004D 004F 0044 0049 0054 0059      0046 004C 004F 0057 |
Encryption (beginner's substitution cypher): (references)475546544315374947474938435459240464957 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.