Skip to content
#

knapsack-problem

Here are 20 public repositories matching this topic...

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.

  • Updated Feb 6, 2021
  • JavaScript

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.

  • Updated Jul 3, 2025
  • JavaScript

Improve this page

Add a description, image, and links to the knapsack-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the knapsack-problem topic, visit your repo's landing page and select "manage topics."

Learn more