Login / Signup

The Unbounded Knapsack Problem.

T. C. HuLeo LandaMan-tak Shing
Published in: Bonn Workshop of Combinatorial Optimization (2008)
Keyphrases
  • polynomially solvable
  • np complete
  • special case
  • np hard
  • genetic algorithm
  • computational complexity
  • linear programming
  • ant colony optimization