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

CUTTING STOCK PROBLEM

Specialty Definition: CUTTING STOCK PROBLEM

DomainDefinition

Math

Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem. It is NP-complete. (references)

Source: compiled by the editor from various references; see credits.

Top     


Alternative Orthography: CUTTING STOCK PROBLEM


Hexadecimal (or equivalents, 770AD-1900s) (references)

43 55 54 54 49 4E 47      53 54 4F 43 4B      50 52 4F 42 4C 45 4D

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01000011 01010101 01010100 01010100 01001001 01001110 01000111 00100000 01010011 01010100 01001111 01000011 01001011 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101

HTML Code (1990) (references)

&#67 &#85 &#84 &#84 &#73 &#78 &#71 &#32 &#83 &#84 &#79 &#67 &#75 &#32 &#80 &#82 &#79 &#66 &#76 &#69 &#77

ISO 10646 (1991-1993) (references)

0043 0055 0054 0054 0049 004E 0047      0053 0054 004F 0043 004B      0050 0052 004F 0042 004C 0045 004D

Encryption (beginner's substitution cypher): (references)

3755545443484125354493745250524936463947

Top     



INDEX

1. Orthography
2. Bibliography


  

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