Wikipedia

Khác biệt giữa bản sửa đổi của “Bài toán xếp ba lô”

Duyệt lịch sử tương tác
← Thay đổi trướcThay đổi sau →
Nội dung được xóa Nội dung được thêm vào
Trực quanMã wiki
Đã cứu 1 nguồn và đánh dấu 0 nguồn là hỏng.) #IABot (v2.0.8
n clean up
Dòng 84:
 
==Sách tham khảo==
* {{Citechú bookthích sách
| authorlink = Michael R. Garey
| first = Michael R. | last = Garey
Dòng 93:
| isbn = 0-7167-1045-5
}} A6: MP9, pg.247.
* <cite name="Kellerer">{{citechú bookthích sách | title = Knapsack Problems |author1=Kellerer, Hans |author2=Pferschy, Ulrich |author3=Pisinger, David | publisher = Springer | year = 2004 | isbn = 3-540-40286-1|mr=2161720 | doi = 10.1007/978-3-540-24777-7}}</cite>
* <cite name="Martello">{{citechú bookthích sách | title = Knapsack problems: Algorithms and computer implementations | url = https://archive.org/details/knapsackproblems0000mart | last1=Martello|first1=Silvano|last2=Toth|first2=Paolo| publisher =Wiley-Interscience | year = 1990 | isbn = 0-471-92420-2|mr=1086874 }}</cite>
 
==Liên kết ngoài==
*[http://www.or.deis.unibo.it/knapsack.html Free download of the book "Knapsack problems: Algorithms and computer implementations", by Silvano Martello and Paolo Toth]
*[http://www.cse.unl.edu/~goddard/Courses/CSCE310J/Lectures/Lecture8-DynamicProgramming.pdf Lecture slides on the knapsack problem]
*[http://download.gna.org/pyasukp PYAsUKP: Yet Another solver for the Unbounded Knapsack Problem] {{Webarchive|url=https://web.archive.org/web/20111006142943/http://download.gna.org/pyasukp/ |date =2011- ngày 6 tháng 10-06 năm 2011}}, 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]
*[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 =2011-05- ngày 23 tháng 5 năm 2011}}
*[http://www.adaptivebox.net/CILib/code/qkpcodes_link.html Codes for Quadratic Knapsack Problem]
{{Use dmy dates|date=September 2010}}
Lấy từ “https://vi.wikipedia.org/wiki/Bài_toán_xếp_ba_lô”