This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).

A genetic algorithm based multi-constraint knapsack problem solver

to find the optimal weight of bag of 20 kg having highest significance,, This program use random list depends upon the choice of user

Multi knapsack problem solver which solves the problem greedy or dynamically

Greedy Algorithm Implementation In Solving The Knapsack Problem Case to Maximum Profit

A genetic algorithm based multi-constraint knapsack problem solver

KNAPSACKer is a universal toolset for solving different types of knapsack (0/1) problems, that is capable of statistical analysis and data visualization.

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.

Project for university. Programming in Java – advanced techniques (Exercise 1: Own library, javadoc, JavaFX and internationalization).

Knapsack algorithm in visual studio UWP application

Semestral project for class NI-KOP at CTU-FIT, contains multiple algorithms for solving Knapsack problem and SAT problem

A greedy heuristic for the knapsack problem.

Solver for Multiple Knapsack Problem Variations

Knapsack problem with greedy algorithm solution

C Program

Algorithms and data structures assignments from university

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.