Boost logo

Boost :

Subject: Re: [boost] Knapsack problem
From: sguazt (marco.guazzone_at_[hidden])
Date: 2011-03-04 02:39:39


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
> problem?

+1

But what kind of knapsack problems?
There are many variants of this problem, some of those are NP-complete.
For instance, see [1].

References:
[1] S. Martello, P. Toth. "Knapsack Problems: Algorithms and Computer
Interpretations", John Wiley & Sons (1990).
     [Freely available online at the author's site:
http://www.or.deis.unibo.it/knapsack.html]

Best,

-- Marco


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk