a branch and bound methods is proposed for minimizing concave function over a convex.
本文介绍了求解凸集上凹函数最优解的一种分支定界方法。
a branch and bound algorithm for solving maximizing a concave function over weakly-efficient;
为设计求解该问题的分支定界算法,建立了非线性整数规划模型。
this article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
借鑒有效集上优化问题的面搜索方法,给出了一种基于面搜索的分支定界法。
to develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法,建立了非线性整数规划模型。
this paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
a branch and bound approach is used to find the optimal unconstrained layout.
采用分支定界法求解沖裁件无约束排样问题;
in this paper, the problem for contract processing sequencing with penalty factor is studied and a branch and bound method for this problem is proposed.
本文研究了具有惩罚因子的合同加工排序问题,提出了相应的分枝定界算法。