**Routing Problems with Loading Constraints (with an**
http://comopt.ifi.uni-heidelberg.de/conferences/traffopt2015/Slides/Martello.pdf

Three-Dimensional Bin Packing Problem (3BP): Pack a set of rectangular boxes (items), of width w j, height h jand length l j(j= 1;:::;n), into the minimum number of three-dimensional rectangular containers of width W, height H, and length L. [Applications: container loading, foam cutting] Three-Dimensional Strip Packing Problem (3SP):

**DA:** 51 **PA:** 24 **MOZ Rank:** 85 **Up or Down:** Up