Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I failed to find any paper that explains the algorithm in a simple manner.

I understand Harmonic(M) which goes like this: Size(1/K - 1/(K-1)] -> Type K-1 -> Pack K-1 per bin

at the end Size(0 - 1/K) -> Use Next Fit

now i just need to understand what the difference is between Refined Harmonic and normal one

share|cite|improve this question
This is the originating paper: C. C. Lee and D. T. Lee. 1985. A simple on-line bin-packing algorithm. J. ACM 32, 3 (July 1985), 562-572. DOI=10.1145/3828.3833 – joseph Nov 27 '13 at 3:40

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.