To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.

为设计求解该问题的分支定界算法，建立了非线性整数规划模型。

youdao

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.

同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。

youdao

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.

该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。

youdao