Read on Wikipedia

Image: VectorVoyager · CC BY-SA 4.0

Knapsack problem

Knapsack problem

Problem in combinatorial optimization.

Legendary
✦✦✦✦
298 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

LegendaryTop 1.5%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 9,810

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 3,995 clicks on its links

  1. Backpack

    Bag carried on one's back.

    7.4%

  2. Combinatorial optimization

    Subfield of mathematical optimization.

    7.1%

  3. NP-completeness

    Complexity class.

    5.6%

  4. Dynamic programming

    Problem optimization method.

    3.3%

  5. Suffix tree

    Tree containing all suffixes of a given text.

    3.3%

  6. Packing problems

    Problems which attempt to find the most efficient way to pack objects into containers.

    1.4%

  7. Resource allocation

    Assignment of resources among possible uses.

    1.3%

  8. Decision problem

    Yes/no problem in computer science.

    0.75%

Readers come from

Share of the 3,544 readers arriving from another article

  1. NP-completeness

    Complexity class.

    13%

  2. Combinatorial optimization

    Subfield of mathematical optimization.

    8.1%

  3. NP-hardness

    Complexity class.

    7.3%

  4. Packing problems

    Problems which attempt to find the most efficient way to pack objects into containers.

    3.9%

  5. George Dantzig

    American mathematician (1914–2005).

    3.6%

  6. Backtracking

    Algorithmic paradigm for constraint satisfaction or enumeration problems.

    2.2%

  7. Birthday problem

    Probability of shared birthdays.

    2%

  8. Ant colony optimization algorithms

    Optimization algorithm.

    1.3%

  9. Search algorithm

    Any algorithm which solves the search problem.

    0.82%

  10. Genetic algorithm

    Competitive algorithm for searching a problem space.

    0.65%