This repository provides an educational comparison of two fundamental approaches to solving the Subset Sum Problem: Brute Force (Exhaustive Search) and Dynamic Programming (DP). The subset sum problem ...

# Sort the array in ascending order as the sequence does not matter we only have to # pick up a subset.

We describe a method for generating cuts for mixed-integer 0/1 programs. These cuts are designed to tighten an integer program prior to applying linear programming based branch and bound algorithms.