Login / Signup

A diversified method for the multi-scenarios max-min knapsack problem.

Thekra Al DouriMhand Hifi
Published in: CoDIT (2016)
Keyphrases
  • knapsack problem
  • max min
  • optimization problems
  • implicit enumeration
  • evolutionary algorithm
  • artificial intelligence
  • cost function
  • dynamic programming
  • probability distribution
  • min max
  • greedy heuristic