• Stars
    star
    8
  • Rank 2,099,232 (Top 42 %)
  • Language
    Python
  • License
    GNU General Publi...
  • Created about 11 years ago
  • Updated about 11 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

This is the dynamic programming, branch and bound and branch and bound low memory solver to solve large instances of the knapsack problem. This was written as part of the course Discrete Optimization on Coursera by Professor. Pascal Van Hentenryck of University of Melbourne.