Login / Signup

A constructive periodicity bound for the unbounded knapsack problem.

Ping H. HuangKwei Tang
Published in: Oper. Res. Lett. (2012)
Keyphrases
  • upper bound
  • lower bound
  • worst case
  • data mining
  • np hard
  • real time
  • data sets
  • information systems
  • image processing
  • database systems
  • vc dimension
  • polynomially solvable