Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Knapsack problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==External links== * [http://www.cse.unl.edu/~goddard/Courses/CSCE310J/Lectures/Lecture8-DynamicProgramming.pdf Lecture slides on the knapsack problem] * [https://web.archive.org/web/20111006142943/http://download.gna.org/pyasukp/ PYAsUKP: Yet Another solver for the Unbounded Knapsack Problem], with code taking advantage of the dominance relations in an hybrid algorithm, benchmarks and downloadable copies of some papers. * [http://www.diku.dk/~pisinger/ Home page of David Pisinger] with downloadable copies of some papers on the publication list (including "Where are the hard knapsack problems?") * [http://rosettacode.org/wiki/Knapsack_Problem Knapsack Problem solutions in many languages] at [[Rosetta Code]] * [http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Dynamic/knapsackdyn.htm Dynamic Programming algorithm to 0/1 Knapsack problem] * [https://web.archive.org/web/20140223114908/http://karaffeltut.com/NEWKaraffeltutCom/Knapsack/knapsack.html Knapsack Problem solver (online)] * [http://www.nils-haldenwang.de/computer-science/computational-intelligence/genetic-algorithm-vs-0-1-knapsack Solving 0-1-KNAPSACK with Genetic Algorithms in Ruby] {{Webarchive|url=https://web.archive.org/web/20110523210824/http://www.nils-haldenwang.de/computer-science/computational-intelligence/genetic-algorithm-vs-0-1-knapsack |date=23 May 2011 }} * [http://www.adaptivebox.net/CILib/code/qkpcodes_link.html Codes for Quadratic Knapsack Problem] {{Webarchive|url=https://web.archive.org/web/20150214020941/http://www.adaptivebox.net/CILib/code/qkpcodes_link.html |date=14 February 2015 }} {{Use dmy dates|date=April 2020}} * [https://web.archive.org/web/20190303205438/http://pdfs.semanticscholar.org/bb99/86af2f26f7726fcef1bc684eac8239c9b853.pdf Optimizing Three-Dimensional Bin Packing] * [http://apmonitor.com/me575/index.php/Main/KnapsackOptimization Knapsack Integer Programming Solution in Python] [[Gekko (optimization software)]] {{Authority control}} {{DEFAULTSORT:Knapsack Problem}} [[Category:Cryptography]] [[Category:Packing problems]] [[Category:NP-complete problems]] [[Category:Dynamic programming]] [[Category:Combinatorial optimization]] [[Category:Weakly NP-complete problems]] [[Category:Pseudo-polynomial time algorithms]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)