Packing problems

Problems which attempt to find the most efficient way to pack objects into containers Spheres or circles packed loosely (top) and more densely (bottom) Covering/packing-problem pairs Covering problems Packing problems Minimum set cover Maximum set packing Minimum edge cover Maximum matching Minimum vertex cover Maximum independent set Bin covering Bin packing Polygon covering Rectangle packing vte Part of a series onPuzzles Types Guessing Riddle Situation Logic Dissection Induction Logic grid Self-reference Mechanical Combination Disentanglement Lock Go problems Folding Stick Tiling Tour Sliding Chess Maze (Logic maze) Word and Number Crossword Sudoku Puzzle video games Metapuzzles Topics Brain teaser Dilemma Joke Optical illusion Packing problems Paradox Problem solving Puzzlehunt Syllogism Tale Lists Impossible puzzles Maze video games Nikoli puzzle types Puzzle video games Puzzle topics vte Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be re