Branch and Bound Algorithm for the 0/1 Knapsack Problem using Lagrangian Relaxation

0/1 Knapsack using Genetic Algorithm written in Java

A genetic algorithm implementation of the binary Knapsack problem.

In this repository i am going to keep some of the important notes and programs which are most useful while Coding.

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.

Design of Algorithms

Algoritmos de programación dinámica

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

0-1 knapsack algorithm implemented in java

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

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