GitHub

Ruei1001/Genetic-algorithm-solve-01-knapsack

Genetic Algorithm for 0/1 Knapsack Problem This project implements a genetic algorithm (GA) to solve the 0/1 knapsack problem. The algorithm evolves a population of potential solutions to maximize the ...
IEEE

Analyzing The Most Effective Algorithm For Knapsack Problems

Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...
IEEE

Competitive decision algorithm for multidimensional knapsack problem

Abstract: The multidimensional knapsack problem (MKP) is a classified NP-hard optimization problem, which is a generalisation of the 0-1 simple knapsack problem (KP). It consists in selecting a subset ...
Scientific Research Publishing

Bányai, T. and Veres, P. (2013) Optimisation of Knapsack Problem with Matlab, Based on Harmony Search Algorithm. Advanced Logistic Systems, 7, 13-20.

ABSTRACT: Normally, the power system observation is carried out for the optimal PMUs placement with minimum use of unit in the region of the Smart power grid system. By advanced tool, the process of ...
GitHub

My COMP546 (Algorithm Design and Analysis) Course Project while I was doing my PhD at KU. It is the Java implementation of my designed algorithm to break an knapsack encrypted ...

Password Cracking problem has been introduced by the Princeton university in 2003. The Knapsack encryption is a public key encryption scheme. Like all the encryption scheme, the Knapsack encryption ...