Branch and Bound is an algorithm for solving discrete optimization problems. The algorithm is implemented in python. The libraries Pulp (for solving the LPs in every step) and Treelib (for the implementation of tree data structure) are used. I also have used the web framework Web2Py for creating a web app and Google Charts for visualizing my results.
-
Notifications
You must be signed in to change notification settings - Fork 0
Branch & Bound python implementation
License
amanolar94/Branch-Bound-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Branch & Bound python implementation
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published