Module misc 

Miscellaneous problems.

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

• BinPacking: Bin Packing (minimize bins)
• Factoring: Integer factorization
• FlowShopScheduling: Flow Shop Scheduling (meet deadline on m processors)
• Knapsack: 0-1 Knapsack (maximize value subject to weight capacity)
• MultiprocessorScheduling: Schedule tasks on processors to meet a deadline
• LongestCommonSubsequence: Longest Common Subsequence
• MinimumTardinessSequencing: Minimize tardy tasks in single-machine scheduling
• PaintShop: Minimize color switches in paint shop scheduling
• SequencingWithReleaseTimesAndDeadlines: Single-machine scheduling feasibility
• SequencingWithinIntervals: Schedule tasks within time windows
• ShortestCommonSupersequence: Find a common supersequence of bounded length
• StringToStringCorrection: String-to-String Correction (derive target via deletions and swaps)
• SubsetSum: Find a subset summing to exactly a target value
• SumOfSquaresPartition: Partition integers into K groups minimizing sum of squared group sums

Structs

BinPacking

The Bin Packing problem.

Factoring

The Integer Factoring problem.

FlowShopScheduling

The Flow Shop Scheduling problem.

Knapsack

The 0-1 Knapsack problem.

LongestCommonSubsequence

The Longest Common Subsequence problem.

MinimumTardinessSequencing

Minimum Tardiness Sequencing problem.

MultiprocessorScheduling

The Multiprocessor Scheduling problem.

PaintShop

The Paint Shop problem.

SequencingWithReleaseTimesAndDeadlines

Sequencing with Release Times and Deadlines.

SequencingWithinIntervals

Sequencing Within Intervals problem.

ShortestCommonSupersequence

The Shortest Common Supersequence problem.

StaffScheduling

The Staff Scheduling problem.

StringToStringCorrection

The String-to-String Correction problem.

SubsetSum

The Subset Sum problem.

SumOfSquaresPartition

The Sum of Squares Partition problem (Garey & Johnson SP19).