You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The knapsack problem is a problem of combinatorial optimization. Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
A web application built with React for solving dynamic programming problems in Operations Research, featuring interactive interfaces for algorithms like Floyd's shortest paths, Knapsack, Optimal BSTs, and Sports Series probabilities. Developed as part of an academic course with a focus on modularity, usability, and visual clarity.
The application was created to introduce the user with the concept of the knapsack problem and to solve optimization problems with the help of available algorithms.