Member Avatar for thompsonSensibl

Hi guys, how are you today?

I have come across this assignment problem that sounds almost like a Knapsack Problem.

This current problem is like the Knapsack Problem, where you must maximise what you put in your sack. But rather than trying to fit in objects that are of fixed volume and value, you are:
trying to fit in different SPICES of different density and value per gram.

Have you encountered such a problem before?
What is it called?

Thanks!
thompsonSensibl

  • 2 Contributors
  • 1 Reply
  • 68 Views
  • 15 Hours Discussion Span
  • Latest Post Latest Post by TrustyTony
Member Avatar for TrustyTony

It is same: density translates directly to volume/weight.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.