In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
The complexity of solving the model with exact algorithms completely was studied and showed that an exact algorithm could not meet the practical requirement in time.
分析了该模型用精确算法进行求解的复杂性，指出对实际问题若完全采用精确算法求解往往达不到实时响应的要求。
This paper offers an exact algorithm for the classic travelling salesman problem, the computational results show that it has some obvious advantages and practical applications.
本文对经典的旅行商问题给出一种精确式算法，计算结果表明，它具有一定的优越性和实用性。
应用推荐