您要查找的是不是:
- The only general solution is linear or integer programming. 唯一通行的解决方法是线性规划或者整数规划。
- all integer programming 全整数编程
- all integer programming problem 全整数编程问题
- Option causes the compiler to check all integer calculations for errors such as overflow or division by zero. 选项使编译器检查所有整数计算中是否存在诸如溢出或被零除这类错误。
- Compiler option lets you specify checked or unchecked context for all integer arithmetic statements that are not explicitly in the scope of a. 关键字范围内的所有非显式整型算术语句指定已检查或未检查的上下文。
- In all integer arithmetic operations, both overflow and underflow shall be ignored. The value returned when either overflow or underflow occurs is implementation defined. 在所有的整数算术运算中;溢位和不足必须被忽视.;发生溢位或不足时;传回值由实作自订
- 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. 列举多个算例,对这些算例进行比较表明,所提出的整数规划算法非常有效。
- In this paper we have found out all integer solutions of the Diophanine equation in the title, which was proposed by Mordell in 1969 and reproposed by Guy in 1981. 1969年,Mordell提出求解不定方程6y~2=(x+1)(x~2-x+6),本文解决了这个问题,求得了这个方程的全部整数解。
- 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 min() function maps all integers to xs: decimal. min()函数将所有整数映射到xs:decimal。
- 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型整数规划问题时,常常遇到组合爆炸问题。
- This program finds the sum of all integers from 1 up to the number entered, excluding all numbers divisible by 3 and all even numbers that are less than 10 and display sum. (译):这个程序认定的总和整数1最多输入的数字,但不包括所有的数字整除3和所有甚至数少于10和显示总和。
- The learning approach leads to a hard mixed integer program that can be solved iteratively in a heuristic optimization. 使用迭代的启发式最优化算法来解决多例学习中复杂的整型规划问题,以使分类风险最小化。