I’m facing a variation of the box stacking problem, the usual box stacking problem is described here: http://algorithms.tutorialhorizon.com/dynamic-programming-box-stacking-problem/

In the variant, the problem is determining the maximal height that can be achieved with the additional constraint that each box can be picked at most k times.

I’m stuck, can anyone help me out? How would you approach this problem?