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).

Knapsack algorithms

Discrete Event Singular Simulation

Knapsack algorithm for files with large arrays and values with dynamic space management.

Implementation of a genetic algorithm to solve the Knapsack problem with a capacity C and a given set of N objects. The genetic fitness function sums up the profits of the objects in the Knapsack.

Explore the Knapsack algorithm in action with this TypeScript implementation that optimizes transaction selection based on account balances. This repository demonstrates how the Knapsack algorithm can be utilized to choose transactions that yield maximum value while adhering to account balance constraints.

Simple project in C to practice using arrays and loops as an assignment in Systems Programming A @ Ariel University

Multi knapsack problem solver which solves the problem greedy or dynamically

This repository will contain all the advanced algorithms

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

Algoritmos de programación dinámica

Do you know how to solve the knapsack? Come and find out how to solve Knapsack in 5 different ways. Time/Space Complexity included

Knapsack algorithm in visual studio UWP application

Message delivery in vehicles to demonstrate the effectiveness of bandwidth transfer application for forwarding using the link duration estimation method in determining the knapsack capacity value based on the average message delivery percentage and delay.

Dynamic programming solution to the knapsack problem.

a recursive solution for the knapsack problem

This repository includes a study that aims to handle the knapsack problem with recursive-methods and dynamic-programming paradigm. Detailed info in ReadMe