How to make a greedy algorithm to solve the java backpack problem

Asked

Viewed 620 times

1

Remembering that I am not able to calculate to solve this problem

java
  • 1

    https://www.geeksforgeeks.org/knapsack-problem/ Have a look there

1 answer

6

You need to join a research team from some world-wide projection faculty - preferably the more technology-oriented ones like Caltech or MIT. Spend years studying, lead a multidisciplinary team, and maybe develop some new hardware (or using quantum processors) you can. What I’ve said so far may sound sarcastic, but I swear it’s not. I’m serious.

The backpack problem is a problem NP-complete. I will not go into the smallest technical details, but just know for now that, for all practical purposes, none of these problems have ever been solved to the satisfaction of a computable algorithm.

If you can solve the backpack problem, you can finally find out if P != NP. Tip, This is worth a million dollar prize from the Clay Mathematics Institute.

Browser other questions tagged java

You are not signed in. Login or sign up in order to post.