Under Multidimensional knapsack STRONGLY NP-complete it was discussed that the Multidimensional Knapsack problem is strongly NP-hard.
Within this discussion the question whether the problem is W-hard when parameterized by dimension d was mentioned, but not finally answered. Is the problem solved?
And: Is there any known xp-algorithm for multidimensional knapsack w.r.t. parameter dimension?