Hi Keith, On Thu, Jan 27, 2011 at 4:09 AM, <[email protected]> wrote: > http://www.sagemath.org/doc/thematic_tutorials/linear_programming.html says: > > The Knapsack problem is the following: given a collection of items having > both a weight and a usefulness, we would like to fill a bag whose capacity > is constrained through maximizing the usefulness of the items it contains > > This doesn't make sense. Should "through" be "though" (or "while")?
Thank you for your bug report. A patch is up at ticket #10697: http://trac.sagemath.org/sage_trac/ticket/10697 -- Regards Minh Van Nguyen -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
