1.6.9 Bin Packing

Problem Input | Problem Output


INPUT                    OUTPUT


Input Description: A set of n items with sizes d_1,...,d_n . A set of m bins with capacity c_1,...,c_m .

Problem: How do you store the set of items using the fewest number of bins?


Implementations

  • Xtango and Polka Algorithm Animation Systems (C++) (rating 3)

    Related Problems

  • Knapsack Problem
  • Job Scheduling
  • Set Packing


    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .