Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通过理论分析提出一种启发式与分枝定界相结合的算法。
This paper first presents a branch-and-bound algorithm to minimize a finite sum of stair-case functions under linear constraints.
该文首先给出了求在线性约束下极小化有限个阶梯函数和的一种分枝定界算法。
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
文中简单说明此问题为NP -难问题,并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms.
同时给出了求解该模型的分支定界算法和贪婪算法,并通过一个数值例子说明和检验以上算法。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上,利用分枝定界算法求解最大割问题。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法,并行化是提高算法性能的有效手段。
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem.
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
本文设计实现的一种专用于计算分支定界算法的机群计算平台,能减少分支定界算法的计算时间复杂度,提高分支定界算法的效率。
Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.
用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。
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.
借鉴有效集上优化问题的面搜索方法,给出了一种基于面搜索的分支定界法。
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
借鉴有效集上优化问题的面搜索方法,给出了一种基于面搜索的分支定界法。
应用推荐