Subject: Re: [boost] Knapsack problem
From: Stirling Westrup (swestrup_at_[hidden])
Date: 2011-03-05 13:01:18
On Fri, Mar 4, 2011 at 2:39 AM, sguazt <marco.guazzone_at_[hidden]> wrote:
> On Fri, Mar 4, 2011 at 1:02 AM, Dávid Tóth <900102xy_at_[hidden]> wrote:
>> Would it be useful to have a library that would be able solve Knapsack
> But what kind of knapsack problems?
> There are many variants of this problem, some of those are NP-complete.
I've run into needing to solve various knapsack problems a number of
times. Often I would be happy with something that just does something
a bit more sophisticated than brute force.
-- Stirling Westrup Programmer, Entrepreneur. https://www.linkedin.com/e/fpf/77228 http://www.linkedin.com/in/swestrup http://technaut.livejournal.com http://sourceforge.net/users/stirlingwestrup
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk