This repository contains C++ implementations of classic algorithms.

Basic implementation of Knapsack-01 problem using dynamic programming

Implementation of a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1

This project optimizes energy consumption using the Knapsack algorithm. It selects the most efficient combination of electrical appliances based on their power consumption and daily usage, ensuring maximum power usage within specified energy limits. Ideal for households and businesses aiming to minimize energy consumption while maximizing utility.

A genetic 01-Knapsack problem solver in CUDA

Applied 0/1 Knapsack Algorithm to optimize artwork selection in limited space of an art gallery

A greedy heuristic for the knapsack problem.

Design of Algorithms

Algoritmos de programación dinámica

Data Structures and Operations, Algorithms..

Implemented some algorithms with non complicated code.

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.

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

Using Dynamic Programming (DP) method to optimize a 0/1 Knapsack Problem for Amazon shopping list.

Execução da Pesquisa da Disciplina Heurísticas e Metaheurísticas

New exact algorithms for integer and rational numbers: unbounded 1-0 M dimensional knapsack, N way sum partition, T group N sum partition, and MKS problems in Python3 and C++.

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.

A knapsack problem solver

Python implementation of a Genetic Algorithm to solve large scale binary knapsack problem