Golang implementation of several classic algorithms for knapsack problem.
· Bug · Request Feature
This repository is for for the knapsack problem and optimized course.
- 0-1 KP
- Bounded KP
- Unbunded KP
- Two-dimensional Cost KP
- Two-dimensional Bin Packing
To get a local copy up and running follow these simple steps.
This is an example of how to list things you need to use the software and how to install them.
-
Clone the knapsack
git clone https://github.com/CausingBrick/knapsack.git
-
Enter the subfolder just run it
go test -run=.
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature
) - Commit your Changes (
git commit -m 'Add some AmazingFeature'
) - Push to the Branch (
git push origin feature/AmazingFeature
) - Open a Pull Request
Distributed under the MIT License. See LICENSE
for more information.
CausingBrick - [email protected]
Project Link: https://github.com/CausingBrick/knapsack