in reply to Packaging Algorithm
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.'
|
---|
Replies are listed 'Best First'. | |
---|---|
RE: Re: Packaging Algorithm
by extremely (Priest) on Nov 07, 2000 at 09:18 UTC | |
by Fastolfe (Vicar) on Nov 07, 2000 at 09:34 UTC | |
by extremely (Priest) on Nov 07, 2000 at 10:06 UTC | |
by tye (Sage) on Nov 07, 2000 at 21:10 UTC | |
by extremely (Priest) on Nov 08, 2000 at 07:09 UTC | |
by tye (Sage) on Nov 07, 2000 at 21:42 UTC | |
by extremely (Priest) on Nov 08, 2000 at 07:18 UTC | |
by tye (Sage) on Nov 08, 2000 at 07:35 UTC | |
by extremely (Priest) on Nov 08, 2000 at 07:59 UTC |
In Section
Seekers of Perl Wisdom