# Effective Strategies on optimizing a separable function

The problem statement is

$max \sum_i f_i(x)$

$s.t. x\in X$

Is there any effective strategies/frameworks that allows me to optimize a separable function?

Like an objective function analogy of branch-and-bound method.

-
 What type of set is $X$? Convexity makes the problem simpler. If convex this may help. – Daryl Oct 3 '12 at 11:14 The original space is not convex, since it is an integer problem. But I can do relaxation so its fine. Thanks for the reading. – Rein Oct 3 '12 at 13:30