Abstract: Many applications in automated auditing and the analysis and consistency check of financial documents can be formulated in part as the subset sum problem: Given a set of numbers and a target ...

This repository is all about various concepts related Dynamic Programming.It also contains solutions to problems from various online judges, organized by topic.

ABSTRACT: The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, ...

Having lectured in some universities and polytechnics in Nigeria, the researchers observed problems in course allocations. There are no lay-down techniques on how courses should be allocated with ...

A dynamic programming approach to determining if there exists a subset of the states in the USA such that the area of those states sums to 47% of the total area of the country. 🇺🇸 ...

Abstract: In this paper, quantum algorithms for solving an instance of the subset-sum problem is proposed and a NMR experiment for the simplest subset-sum problem to test our theory is also performed.