Login / Signup

Upper and lower bounding procedures for the multiple knapsack assignment problem.

Seiji KataokaTakeo Yamada
Published in: Eur. J. Oper. Res. (2014)
Keyphrases
  • multiple knapsack
  • upper bound
  • branch and bound
  • search algorithm
  • combinatorial optimization problems
  • min cost
  • neural network
  • genetic algorithm
  • objective function
  • bin packing