A genetic 01-Knapsack problem solver in CUDA
-
Updated
Feb 17, 2014 - C
A genetic 01-Knapsack problem solver in CUDA
Implemented some algorithms with non complicated code.
0/1 Knapsack using Genetic Algorithm written in Java
0-1 knapsack algorithm implemented in java
A genetic algorithm implementation of the binary Knapsack problem.
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.
Trabalhos da disciplina Teoria Da Computação - UFMS CPPP
Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.
Must Do Coding Questions
Design of Algorithms
Data Structures and Operations, Algorithms..
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.
A greedy heuristic for the knapsack problem.
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
Implementation of a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1
Branch and Bound Algorithm for the 0/1 Knapsack Problem using Lagrangian Relaxation
Using Dynamic Programming (DP) method to optimize a 0/1 Knapsack Problem for Amazon shopping list.
Add a description, image, and links to the knapsack01 topic page so that developers can more easily learn about it.
To associate your repository with the knapsack01 topic, visit your repo's landing page and select "manage topics."