1. In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.

2. Unfortunately, there is no rule that will help you to look at a phrasal verb and always know whether it is separable or nonseparable .