To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
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.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
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.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
This paper discusses the problem of choosing optical cable route with branch and bound way and puts forward the model of planning route in Layered network.
本文利用分枝限界法解决了自愈环光缆路由的选择问题，提出了分层网络光缆路由规划的数学模型。
For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
运用多目标规划理论与分枝定界法对模型进行求解。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
应用推荐