Knapsack problem
en.wikipedia.org · 8,514 words · saved by 1 readers
The knapsack problem is the following problem in combinatorial optimization:
Knapsack problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Problem in combinatorial optimization Example of a one-dimensional (constraint) knapsack problem: which books should be chosen to maximize the books' value while still keeping the overall weight under or equal to 15 kg? A multiple constrained problem could consider both the weight and volume of the books. (Solution: if any number of each book is available, then three yellow books and three grey books; if only the shown books are available, then all except for the green book.) The knapsack problem is the fol
saved by
related reading
- knapsack problem - 演算法筆記web.ntnu.edu.tw
- Partitioning to solve Bin Packing Problemsarxiv.org
- Mathematical optimization - Wikipediaen.wikipedia.org
- P versus NP problem - Wikipediaen.wikipedia.org
- Competitive Programmer's Handbookcses.fi
- Greedy algorithm - Wikipediaen.wikipedia.org
- Pareto front - Wikipediaen.wikipedia.org
- Algorithm - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Travelling salesman problem - Wikipediaen.wikipedia.org
- Many Hard Leetcode Problems are Easy Constraint Problems • Buttondownbuttondown.com
- Tim Roughgarden's Lecture Notestimroughgarden.org