In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
应用推荐