Diophantine equation; prime; integer solution; Legendre symbol; congruence.
丢番图方程；素数；整数解；勒让德符号；同余。
Diophantine equation; Positive integer solution; congruence; Recurrent sequence.
丢番图方程；正整数解；同余；递归序列。
Theoretically speaking, only ambiguity success rate is a severe approach to evaluate the rightness of ambiguity integer solution.
从理论上讲，只有模糊度的成功率才是评价模糊度整数解正确性的严密尺度。
This scatter search approach interactively USES a combined dispatching rule to solve a scheduling sub-problem corresponding to each integer solution visited in the search process.
提出的算法对整数变量进行搜索，并采用合并调度规则来求解整数解对应的调度子问题。
Because this integer point may not be as far from the origin as the relaxed solution point.
因为这个整数点距离原点的距离可能不如放松限制的解决方案点那样远。
In other words, while using classes with integer constants like this might be a passable solution, it's not a very efficient one.
换句话说，在使用这类带有整型常量的类时，该解决方案也许可行，但并不是非常有效。
The first section says that the solution found is integer optimal, and that the value found for the objective function is 23, a minimum.
第一部分说明所找到的解决方案是整型优化的，为目标函数找到的最小值是23。
Another question you might ask is: "is the optimal solution of an integer somehow related to its relaxed problem's optimal solution?"
您可能会问的另外一个问题是：“整型问题的优化解决方案与放松限制问题的优化解决方案有关联吗？”
Thus, a relaxation of the constraint of an integer problem does not necessarily improve the solution, because the feasible region is discrete and not continuous.
因此，整型问题的约束放松并不一定会改进解决方案，因为可行域是离散的，而不是连续的。
The optimal solution would still be the integer point (2, 0), though more integer points are feasible now.
优化解决方案仍然是整数点(2,0)，不过现在可行域中有更多整数点了。
In this particular case, the optimal solution for both the integer and non-integer problems is the same, but that's not always the case.
在这种特例中，整型和非整型的优化解决方案是相同的，但是并非所有情况都是如此。
Just know that the optimal solution for a non-integer problem is always one of the polyhedron vertices.
我们只需要知道非整型问题的优化解决方案通常都是一个多面体的顶点就好了。
It is shown by an example that though these two approaches have different performance process, but they have the same integer ambiguity solution and the equivalent search efficiency.
实例试算表明这两种方法有着不同的执行过程，但有着相同的模糊度整数解和相当的搜索效率。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this article, the methods for solution of a nonlinear mixed integer Programming is discussed.
本文讨论一类非线性混合整规划问题的解法。
To shorten the time of the solution of integer ambiguity and improve its validity, the LAMBDA algorithm is introduced.
为缩短模糊度搜索时间，提高模糊度解算的正确率，本文引入LAMBDA法进行解算整周模糊度。
The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
A simple universal coevolutionary algorithm based on pointer-based integer coding schema is implemented to find the optimal solution of the reconfiguration model.
设计了一种采用基于编号的整数编码方案的简单通用协同进化算法，实现了对重构模型的优化求解。
Model checking based on decision diagram causes memory explosion in integer multiplier verification. An efficient solution to this problem is backward substitution method.
采用基于决策图的模型检验方法对整数乘法器验证时会出现内存爆炸，解决该问题的一种有效途径是采用反向替换方法。
The problem of preparation of linear materials is a typical integer programing. In this paper, the selection of decision schemes, modeling, the analysis of solution are studied.
线材的合理利用问题是一类很有代表性的整数规划问题。本文对线材下料问题决策的方案选择、模型的建立、解的分析进行了系统的分析和研究。
A model was built based on mixed-integer linear programming. Through the model solution and revision and diverse distribution, the optimal layout of the logistics distribution of an area was obtained.
采用混合整数规划法建立模型，通过对模型的求解和修正，并实施多样化分拨，得出该地区物流配送的最优规划布局。
When using the LAMBDA method to fix an integer ambiguity of GPS carrier phase measurements it is necessary to have a high accuracy of float solution.
用LAMBDA方法确定GPS载波相位测量的整周模糊度，需要较高精度的浮点解。
The optimal solution can be got by Integer Programming module. The module's restriction can be established by the synchronous, mutually exclusive and ordinal need.
本文的数学模型根据检修操作的同时性、顺序性和互斥性要求，建立了约束条件；
The optimal solution can be got by Integer Programming module. The module's restriction can be established by the synchronous, mutually exclusive and ordinal need.
本文的数学模型根据检修操作的同时性、顺序性和互斥性要求，建立了约束条件；
应用推荐