The Knapsack Problem is a well-known optimization problem in computer science and operations research. It involves selecting a subset of items with specific values and weights to maximize the total value while not exceeding a given capacity constraint. This repository provides JavaScript implementations of different algorithms to solve the Knapsack Problem efficiently.
To use the Knapsack Problem solver, follow these steps:
-
Clone the repository using the following command:
git clone https://github.com/Bilal-Belli/KnapsackProblem.git -
Open the index.html file in your preferred web browser.
-
The web page will present you with an interface to enter the item details and the capacity limit.
-
Select the algorithm you want to use from the available options.
-
Click the "Solve" button to see the solution for the Knapsack Problem.
Contributions are welcome! If you have any suggestions, improvements, or bug fixes, please feel free to open an issue or submit a pull request.
This project is licensed under the MIT License. Feel free to use and modify the code for your own purposes.