Research Article

Polynomial Time Instances for the IKHO Problem

Figure 9

Covering 𝑥 o p t recursively. An optimal solution 𝑥 o p t is drawn. The black elements are determined by the first call of (24). The more gray knapsacks are determined by the two next levels of calls.
859820.fig.009