With all do respect to our esteemed monk extremely
is this not closer to the 'Knapsack' and 'bin packing'
class of problems which can be solved using several
non-brute force techniques therefore do not fall into the general class
of NP-Complete problems.
There are several books that cover detailed solutions to
these kinds of problems. My personal favourite is
'ALGORITHMS', Robert Sedgewick, Addison-Wesley, 1983.
Sedgewick describes some excellent
approaches to your problem.
Computer Algorithms, Inroduction to Design and Analyssis,
Sara Base, Addison-Wesley 1988 is also a good source.
mitd-Made in the Dark
'My favourite colour appears to be grey.'
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
Outside of code tags, you may need to use entities for some characters:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||