hlaahmed / optimization-techniques-for-solving-NP-hard-problem

solving 0-1 knapsack using simulated annealing, genetic algorithms, dynamic programming, branch and bound, greedy, brute force and divide&conquer

optimization-techniques-for-solving-NP-hard-problem

solving 0-1 knapsack using simulated annealing, genetic algorithms, dynamic programming, branch and bound, greedy, brute force and divide&conquer