您要查找的是不是：
- Neighborhood integral point search method of solving standard form pure integer programming 邻域整点搜索法求解标准型纯整数规划
- pure integer programming 纯整数规划
- The branch delimitation law may ask the pure integer or the linear programming question, the solution method is composed by the branching step and bounding step. 摘要分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
- The only general solution is linear or integer programming. 唯一通行的解决方法是线性规划或者整数规划。
- pure integer programing 纯整数规划
- It isn't true that QuickSort is the fastest Algorithm available.This is only true for pure Integer or Word arrays. 快速排序并不真是最快的排序算法，它只对纯整形或字数组有效。
- A mixed integer programming formulation for the off-line version of the problem has been proposed. 给出了问题的数学描述，并对其静态问题，构造了一个混合整数规划模型。
- To general 0-1 Integer Programming Problem problem, we present a semi-roboticized DNA computing model. 摘要对一般的0-1整数规划问题提出了一种半自动化的DNA计算模型。
- The integer programming algorithm in this paper is proved very efficient natty examples. 列举多个算例，对这些算例进行比较表明，所提出的整数规划算法非常有效。
- Convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. 凸分析、拉格朗日松弛法、不可微分函数最适化以及在整数规划上的应用。
- This paper formulates the satellite imaging scheduling problem as a 0-1 integer programming model,which is NP complete. 建立了卫星成像调度问题的0-1整数规划模型,该问题具有NP完全特性。
- The paper uses integer programming to research repositioning of intermodal empty container of land-carriage . 摘要 本文应用整数规划的方法研究了集装箱陆上空箱多式联运调运优化问题。
- The approximate algorithm of a nonliear bilevel integer programming for global optimization was disscussed. 讨论了一类非线性两级整数规划全局优化的求解问题。
- Finally, compared with the CGA and classical integer programming (IP), the efficiency of fCGA is shown by the simulation results. 最后,根据生产实践中得到的数据进行了仿真,通过压缩遗传算法和整数规划方法的比较,验证了快速压缩遗传算法在解决多目标优化问题上的有效性。
- The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. 求解最小生成树的方法虽然很多,但是利用LINGO建立相应的整数规划模型是一种新的尝试。
- The combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways. 用穷举法和隐枚举法解0-1型整数规划问题时,常常遇到组合爆炸问题。
- The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization. 使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题，以使分类风险最小化。
- It was pure luck that he was home when we called. 非常幸运，我们打电话时他在家里。
- The optimal solution of this integer programming model is derived by Lingo 5.0.And the distribution scheme of the first 30 clients is given. 以会员的最大满意度为目标函数，建立一个整数规划模型，得到问题的分配方案，并计算出前30位会员的分配结果。
- Be inspired from natural plant growth,this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming. 从大自然植物生长中得到启发,提出了一种求解非线性整数规划全局最小解的仿生算法。
