Module misc 

Miscellaneous problems.

Problems with unique input structures that don’t fit other categories:

• BinPacking: Bin Packing (minimize bins)
• Factoring: Integer factorization
• Knapsack: 0-1 Knapsack (maximize value subject to weight capacity)
• PaintShop: Minimize color switches in paint shop scheduling
• SubsetSum: Find a subset summing to exactly a target value

Structs

BinPacking

The Bin Packing problem.

Factoring

The Integer Factoring problem.

Knapsack

The 0-1 Knapsack problem.

PaintShop

The Paint Shop problem.

SubsetSum

The Subset Sum problem.