A branch and bound algorithm for solving a class of nonlinear 0-1 knapsack problems is proposed, in which branching is common 0-1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the op
A branch and bound algorithm for solving a class of nonlinear 0-1 knapsack problems is proposed, in which branching is common 0-1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the op
摘要构造出了一类可分离非线性0-1背包问题的分枝定界算法，分枝的过程是普通的0-1变量分枝，用简单的取整启发式法确定更好的可行解；而在每个分枝结点处用线性松弛技术确定了它的子问题的一个线性规划松弛逼近，由此得到最优值的一个下界。