knapsack0-1

There are 4 repositories under knapsack0-1 topic.

  • Avcuongy/Knapsack-Problem-Genetic-Algorithm

    This is the group's project

    Language:Jupyter Notebook1

  • BaseMax/0-1KnapsackRecursiveC

    This is an implementation of the 0-1 knapsack problem in C using a recursive approach. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

    Language:C120

  • BaseMax/0-1KnapsackDynamicProgrammingC

    This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

    Language:C20

  • BaseMax/0-1KnapsackGreedyC

    This is an implementation of the 0-1 knapsack problem in C using a greedy algorithm. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity. The goal is to determine the subset of items that maximizes the total value of the knapsack without exceeding its weight capacity.

    Language:C20