John Randall wrote: I do not see multiplication used in any of the algorithms on that page. > > OK: I may be misinterpreting it.
Let me have another go at interpreting the page http://cgm.cs.mcgill.ca/~msuder/courses/360/lectures/integer-knapsack.html and how it applies to Raul's problem. We have weight vector w, a value vector v, and a maximum weight W. We want to find a solution vector p which maximizes p dp v subject to W>:p dp w (where dp is dot product). In Raul's case, v=w. I do not see why entries of p are restricted to 0 and 1 for the restaurant problem: you can order several of a single item. Best wishes, John ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
