Login / Signup

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.

Konstantinos KaparisAdam N. Letchford
Published in: Eur. J. Oper. Res. (2008)
Keyphrases
  • multidimensional knapsack problem
  • knapsack problem
  • tabu search
  • genetic algorithm
  • probabilistic inference
  • cover inequalities
  • computational complexity
  • upper bound
  • graphical models
  • linear programming