The bin-packing problem

Every computer scientist learns, at some point, algorithms for solving
the bin-packing problem. That is: given a container of limited size
and objects of varying size and value, find the combination of items
that results in maximum value. As the exhaustive way of solving this
problem is, of course, exhausting, I choose the greedy heuristic: take
the items that mean the most to me and put them in.

So I take with me only the things with memories attached to them,
because those are the only things worth keeping anyway…

Random Emacs symbol: calendar-make-alist – Function: Make an assoc list corresponding to SEQUENCE.

  • Nasser

    Dear Sacha

    Well, to me using greedy algorithm could be good, but I’d rather prefer a GA meta hueristic which to some extent more efficient!

    cheers