Dear Meino,
doing some googling gives this Ruby implemention for solving the
knapsack
problem (stuffing m items into n with cost/storage
constraints):
_http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/178925_
(http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/178925)
Best regards,
Axel