David Sheldon, UC Riverside 15 of 22 Disjunctively Constrained Knapsack Problem: If conjoined unit included, can t also include standalone unit Solution: Map to disjunctively-constrained 0-1 knapsack Yanada T., Heuristic and Exact Algorithms for the Disjunctively Constrained Knapsack Problem , 2002 Prohibits specific item pairs from being in the knapsack ILP solution, running time is pseudo polynomial Base MicroBlaze Available FPGA Base MicroBlaze Knapsack MUL 1 1 1 FPU 1 MUL 2 2 2 FPU 2 Items: MUL C C C FPU C
{}