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

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.

Discrete Event Singular Simulation

Repository about Dynamic Pogramming, exercises and examples.

About InvestKuy aims to bridge the gap between investors and efficient financial decision-making by leveraging advanced algorithms. Designed with both novice and experienced investors in mind, InvestKuy offers a seamless and intuitive platform for optimizing investment portfolios. The system analyzes your risk tolerance and investment goals, then

This repository contains the Knapsack problem solver using dynamic programming in python. Under the instances folder there are multiple example files to test given different amount of objects (n) to add in the sack of capacity M.

Algorithms and data structures assignments from university

Repository for Call Analyst Optimization Model (CAP Model)

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

Skrypt python służący do wizualizacji i rozwiązywania problemu plecakowego, wykorzystująca matplotlib, numpy oraz pandas do analizy i graficznego przedstawienia optymalnych kombinacji wag i wartości przedmiotów. Idealny do wizualizacji problemu co ułatwi jego zrozumienie oraz naukę.