您要查找的是不是:
- The integer programming algorithm in this paper is proved very efficient natty examples. 列举多个算例,对这些算例进行比较表明,所提出的整数规划算法非常有效。
- Integer Programming Algorithm for Finding Minimal Reduction in Decision Table Based on Rough Set 基于Rough集的决策表属性最小约简的整数规划算法
- integer programming algorithm [计] 整数规划算法
- The approximate algorithm of a nonliear bilevel integer programming for global optimization was disscussed. 讨论了一类非线性两级整数规划全局优化的求解问题。
- The only general solution is linear or integer programming. 唯一通行的解决方法是线性规划或者整数规划。
- Be inspired from natural plant growth,this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming. 从大自然植物生长中得到启发,提出了一种求解非线性整数规划全局最小解的仿生算法。
- The problem is formulated as a mixed integer programming and an corresponding algorithm is put forward,which first planed location,and then planed resources allocation,and solv. 针对该问题构建了混合整数规划模型,提出了一种先进行选址然后进行资源分配的优化算法。
- The algorithm has steadiness in precision and formulation in program algorithm. 该方法具有精度稳定性好,编程算法简洁的特点。
- 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计算模型。
- 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 . 摘要 本文应用整数规划的方法研究了集装箱陆上空箱多式联运调运优化问题。
- A forward dynamic programming algorithm is presented in allusion to features of the moving infrared small dim target. 文章针对低信噪比下红外弱小运动目标的特点,提出了一种正向动态规划算法。
- An Improved Genetic Programming algorithm (IGP) was developed for the synthesis of complex distillation systems. 提出了一种可用于复杂精馏系统综合的改进遗传规划算法,利用其独特的层次化结构来直观地表达问题。
- Finally, compared with the CGA and classical integer programming (IP), the efficiency of fCGA is shown by the simulation results. 最后,根据生产实践中得到的数据进行了仿真,通过压缩遗传算法和整数规划方法的比较,验证了快速压缩遗传算法在解决多目标优化问题上的有效性。
- An Improved Genetic Programming algorithm(IGP) was developed for the synthesis of complex distillation systems. 提出了一种可用于复杂精馏系统综合的改进遗传规划算法,利用其独特的层次化结构来直观地表达问题。
- The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. 求解最小生成树的方法虽然很多,但是利用LINGO建立相应的整数规划模型是一种新的尝试。
- Transform the model into a classic unbounded knapsack problem and present a dynamic programming algorithm to solve it. 对此模型用动态规划的方法进行求解,得到了测试用例的最优分配方案;
- The combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways. 用穷举法和隐枚举法解0-1型整数规划问题时,常常遇到组合爆炸问题。