Before revision:  We further obtain a tight (1-e^{-1-\epsilon)-approximation for monotone submodular optimization subject to a constant number of multiple knapsack constraints and a matroid constraint, and a (}  0.385- \epsilon )-approximation for non-monotone submodular optimization subject to a constant number of multiple knapsack constraints.
After revision:  We further obtain a tight (1-e^{-1-\epsilon)-approximation for monotone submodular optimization subject to a constant number of multiple knapsack constraints and a matroid constraint, and a (} Another example is Non-monotone Submodular Multiple Knapsack, for which we obtain a ( 0.385- \epsilon )-approximation for non-monotone submodular optimization subject to a constant number of multiple knapsack constraints.