Services & ResourcesWolfram ForumsMathGroup Archive

[Date Index] [Thread Index] [Author Index]

Re: 0/1 knapsack-like minimalization problem and

• To: mathgroup at smc.vnet.net
• Subject: [mg108790] Re: 0/1 knapsack-like minimalization problem and
• From: Peter Sisak <p-kun80 at hotmail.com>
• Date: Wed, 31 Mar 2010 06:21:25 -0500 (EST)
• References: <hosi6n$o6a$1@smc.vnet.net>,<201003311027.FAA09377@smc.vnet.net>

Hello,

  I see not how Nearest[] could be readily employed for this kind of analysis. Care to provide an example code snippet?

Thank you
Peter Sisak

----------------------------------------
> Date: Wed, 31 Mar 2010 05:27:55 -0500
> From: dmaxwarren at gmail.com
> Subject: [mg108783] Re: 0/1 knapsack-like minimalization problem and file=
 system access
> To: mathgroup at smc.vnet.net
>
> There are a number of functions in Mathematica 7 for doing just this
> kind of analysis. Look up Nearest[].
>
> Daniel
> 		 	   		 
_________________________________________________________________

• References:
  • Re: 0/1 knapsack-like minimalization problem and file system access
    • From: dr DanW <dmaxwarren@gmail.com>