The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...

NP-Complete Problems Lab: Subset Sum This project was completed as a laboratory activity for the course [Course Name/Number]. It explores the NP-complete problem known as the Subset Sum Problem. Group ...

This project implements a multi-part assignment that analyzes financial transaction data against target amounts. The tasks include dataset preparation, exact/approximate matching, dynamic programming ...

An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible ...