#6749: [with patch, needs work] Knapsack algorithm
-------------------------+--------------------------------------------------
Reporter: ncohen | Owner: jkantor
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.1.2
Component: numerical | Keywords:
Reviewer: | Author:
Merged: |
-------------------------+--------------------------------------------------
Comment(by wdj):
Replying to [comment:1 wdj]:
> This needs a really detailed example, worked out so that a non-expert
(like myself) can understand it. Think of the first example you would try
to teach an undergraduate. That would be perfect.
For example, there seems to be a simple knapsack problems solved here:
http://sites.google.com/site/mikescoderama/Home/0-1-knapsack-problem-in-p
There is a more complicated one here:
http://rosettacode.org/wiki/Knapsack_Problem#Simple_Solution
Also,
http://webspace.ship.edu/thbrig/DynamicProgramming/Knapsack%20Program/index.html,
and the xkcd example
http://www.itl.nist.gov/div897/sqg/dads/HTML/knapsackProblem.html :-)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6749#comment:2>
Sage <http://sagemath.org/>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
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-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
