A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem

3 Apr 2014Jun HeFeidun HeHongbin Dong

The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.