Updated Knapsack Problem Example!

  • 13 September 2022
  • 0 replies
Updated Knapsack Problem Example!
Userlevel 5
Badge +6

Hello Everyone!

One more renewed example is live! Come check!

This example introduces a knapsack problem. The example considers a data set of 16 items which can be included in the knapsack. The objective is to maximize the accumulated value of the items. The number of items is restricted by the maximum weight that can be carried in the knapsack.

We used a lot WebUI new features, you can find the full example app here.


Feel free to use this thread to anything you need about this example.

0 replies

Be the first to reply!


Didn't find what you were looking for? Try searching on our documentation pages:

AIMMS Developer & PRO | AIMMS How-To | AIMMS SC Navigator