查询词典 integer programming

based on the analysis of the traditional gnss carrier phase measurement model and the rule of the integer ambiguity estimation,the quality of normal integer mapping is gained,then,the theory of rough integer mapping is proposed,the question of gnss integer ambiguity estimation is solved,the searching efficiency of integer ambiguity is improved,the problem of gnss carrier phase measurement in a certain extent is solved.

摘 要：在分析传统的基于gnss载波相位测量模型对整周模糊度解算的一般规律后，得出一般归整映射的性质，进而提出粗糙归整映射理论，用来解决整周模糊度浮点解归整问题，提高了整周模糊度的搜索效率，一定程度上解决了载波相位实时测量的技术难题。

Generally considered non-linear integer programming can be divided into linear and integer part, so often Integer linear programming as a special part.

一般认为非线性的整数规划可分成线性部分和整数部分，因此常常把整数规划作为线性规划的特殊部分。

In this paper, based on the conjugate function and the dual programming of convex programming, with the dual cone, to conic programming, the dual programming is fully discussed, the expression of the dual programming is educed, the main dualities are proved, and the dualities of the familiar conic programming are studied.

以共轭函数和凸规划的对偶规划为基础，利用对偶锥的概念，全面讨论了一般锥规划的对偶问题，严格推导出锥规划对偶规划的表示形式，给出了锥规划的主要对偶性质，并用这些结果研究了常见锥规划的对偶性。

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

本课程对整数最优化的理论、算法和应用做了全面的介绍。课程分为四部分：公式和松弛、整数最优化的代数学和几何学、整数最优化的算法，以及整数最优化的拓展。

The division with surplus, the comprehensive division and Eisenstein Test applications on polynomial that can not be divided are mainly discussed; the sufficient condition of that polynomial with coefficient being integer has no integer root, that cubic polynomial with coefficient being integer is irreducible in rational domain and that polynomial with coefficient being integer has not two completely same roots are summed up.

主要论述了带余除法、综合除法及不可约多项式艾森斯坦判别法的应用；总结出了整系数多项式的无整数根的充分性，三次整系数多项式在有理数域上不可约的充分性，整系数多项式无重根的充分性。

We define an extended class of integer linear first-order logic formula, which supports most integer linear and bit-wise expressions in C programs including integer division, integer modular and bit-wise operation.

我们定义了一类整数线性一阶逻辑判定公式，此类判定公式支持C程序中常用的整数线性运算。

This book discusses linear and nonlinear programming, dynamic programming, integer programming and stochastic programming.

本书讨论了线性和非线性规划，动态规划，整数规划和随机规划。

This course offers an introduction to primary convex analysis, linear programming, non-linear programming, dynamic programming, multi-objective programming, multi-level programming, calculus of variations, and optimal control, which are the optimization methods commonly used in economics and finance.

课程内容简介：本课程介绍凸分析基础、线性规划、非线性规划、动态规划、多目标规划、多层规划、变分法、最优控制，这些都是西方经济学、金融学中常用的最优化方法。

Finally, we obtain the solutions of the 0-1 Integer Programming problem. The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.

该模型的最大优点在于具有自动化的特点；同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

But this is impossible, as long as it is engaging in a market economy, there are risks in any operation.

但是，这是不可能的，只要是搞市场经济，是有风险的任何行动。

We're on the same wavelength.

我们是同道中人。