Bin Packing

Topic Classification: nid, "Topic Classification"); ?> Tags: nid, "Problem Tag");?>
Grade Vs Difficulty:
  EasyModerateChallengingPerplexing
1-2
3-4
5-6
7-8
9-10
11-12
13-14

This Tom Davis lesson considers several problems related to bin packing. It starts with the question of filling a grid polytope with dominoes, moves to the question of tiling a square with non-congruent squares, and concludes with a classic optimization question.

http://www.geometer.org/mathcircles/