Login / Signup

A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.

Gábor GalambosJ. B. G. Frenk
Published in: Discret. Appl. Math. (1993)
Keyphrases
  • bin packing
  • lower bound
  • upper bound
  • optimal solution
  • search tree
  • sufficiently accurate
  • objective function
  • assembly line balancing
  • special case
  • np hard
  • cutting stock