0
$\begingroup$

I came across a question that requires an alternate implementation converse to the normal Knapsack which is based on a 0-1 logic of considering whether or not to consider an item for the optimal solution. Instead, the alternate implementation is to consider what is the largest indexed job in the optimal solution.

Would you have any suggestions for how I can work with this?

Thanks!

| cite | improve this question | |
$\endgroup$
  • 1
    $\begingroup$ Could you please state your problem formally? Why is it talking about jobs? $\endgroup$ – Steven May 5 at 13:32

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.