Login / Signup

Lower bounds for online bin covering-type problems.

János BaloghLeah EpsteinAsaf Levin
Published in: J. Sched. (2019)
Keyphrases
  • lower bound
  • upper bound
  • online learning
  • randomly generated problems
  • optimization problems
  • np complete
  • decision problems
  • real time
  • branch and bound
  • benchmark problems