integer-program

基本解释

The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO.
求解最小生成树的方法虽然很多,但是利用LINGO建立相应的整数规划模型是一种新的尝试。
The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization.
使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题，以使分类风险最小化。
The only general solution is linear or integer programming.
唯一通行的解决方法是线性规划或者整数规划。
In this paper the VP route program problem(VPR)in ATM networks is analyzed The problem is transformed into a kind of bottleneck multiple choice integer program problem(BMCIP).
本文对ATM网络虚通道路由规划问题(VPR)进行了分析，并将此类问题转化为一类瓶颈多选择整数规划问题(BMCIP)，针对此类问题特点提出了一种新的有效的求解方案。
The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model.
本文利用树根和节点级数的概念 ,借助于LINGO建立了求解最小生成树的整数规划模型 ,并对模型中的难点给出了详细的注释。