The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。
Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.
用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。
The static planning constructs the mixed integer programming model . A branch exchange technique based on the change base of linear programming solves the model effectively.
静态规划建立了混合整数规划模型，利用基于线性规划换基运算的支路交换法有效地求解该模型。
The dynamic programming is a branch that it is multi-stage decision-making process of solving a mathematical optimization method.
动态规划是运筹学的一个分支，它是解决多阶段决策过程最优化的一种数学方法。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
运用多目标规划理论与分枝定界法对模型进行求解。
In order to improve the computational efficiency, a branch algorithm for general integer linear programming problems on the objective function hyperplane shifts was presented.
为了提高求解一般整数线性规划问题的效率，提出了一种基于目标函数超平面移动的分支算法。
Message Oriented Middleware (MOM) is an important branch of middleware which uses message to build an asynchronous and decoupled programming architecture for network computing.
消息中间件是 中间件的一个重要分支，它采用消息的方式为网络计算提供了异步低耦合的编程架构。
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 -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
As an important branch of optimization theory, nonlinear programming has always been research field which was universal concerned by various disciplines since the 1960s.
非线性规划作为最优化理论的重要分支，其研究问题的领域和解决问题的方法自上世纪60年代以来是各学科关注的焦点。
In computer programming, a process which repeats the same series of processing steps until a predetermined state or branch condition is reached.
一种计算机程序它反复地执行某一系列指令直到完成某一特定条件为止。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
When to switch from Dynamic Programming (2D table) to Branch & Bound algorithm?
当切换动态规划（二维表）的分支定界算法？
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
Complementarity problems are of an important branch in the mathematical programming field, which are widely found in many fields such as engineering, economics and traffic control.
互补问题是一类非常重要的优化问题，它在工程，经济与交通平衡等领域有着广泛的应用。
Complementarity problems are of an important branch in the mathematical programming field, which are widely found in many fields such as engineering, economics and traffic control.
互补问题是一类非常重要的优化问题，它在工程，经济与交通平衡等领域有着广泛的应用。
应用推荐