Re: need a function for sums of subsets
- To: mathgroup at smc.vnet.net
- Subject: [mg33080] Re: need a function for sums of subsets
- From: "Rasmus Debitsch" <Debitsch at t-online.de>
- Date: Fri, 1 Mar 2002 06:51:38 -0500 (EST)
- References: <a5clm3$9gl$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hello,
your problem sounds like a knapsack problem. Daniel Lichtblau mentioned that
most problems of this type are NP-complete. There should be a rich set of
theory in the net for the problem.
The "Global Optimization" add on from Craig Loehl provides methods for
heuristic solutions:
- InterchangeMethodMin,
- TabuSearchMin and
- MultiStartMin.
For the last function you may find an example in the manual of the package
(chapter X.3 Integer Programming: The Knapsack Problem).
Regards
Rasmus
--
----------------------------------------------------
Rasmus Debitsch
Mecklenburger Straße 6
73431 Aalen
Tel.: 07361 35435
eMail : debitsch at t-online.de
debitsch at zeiss.de
----------------------------------------------------