A mixed integer programming formulation for the off-line version of the problem has been proposed.
给出了问题的数学描述，并对其静态问题，构造了一个混合整数规划模型。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal.
选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。
It is to understand the basis for other integer programming problem.
它是理解其它整数规划问题的基础。
The master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
The scheduling is formalized as a integer programming problem.
该描述将调度问题形式化为整数规划问题。
One of the most important thing is a pure integer linear programming problem.
其中最重要的是纯整数线性规划问题。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
According to the standard form of MID system, the problem of mixed integer quadratic programming (MIQP) and its mathematics description can be obtained.
根据混合逻辑动态系统的标准形式，转化为混合整数二次规划(MIQP)的问题，同时获得它的数学描述。
To resolve the problem of the traditional linear sensor networks design not having detailed integer linear programming (ILP) model, an optimal redundant sensor network model was proposed.
针对传统的线性测量网络设计中没有给出具体的整数线性规划(ILP)模型问题，提出一种传感器优化配置模型。
Based on the research of the internal features of maintenance scheduling problem, this paper establishes its integer programming based optimization module and algorithm.
本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
Three rules are put forward for simplifying the DCPM problem based on the first decision network, and a new integer programming model is developed for solving the problem.
对以第一种网络为基础的DCPM问题，本文首先介绍了三条简化法则，然后建立了一个求最优解的新整数规划模型；
We will show that the traditional mixed integer programming approach makes the problem difficult to represent and solve.
我们将说明传统的混合整数规划方法使问题难以描述和解决。
This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management.
对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
The joint decision-making problem for chain store location and distribution center selection is formulated as a fuzzy multi-objective mixed-integer programming model.
建立了连锁门店选址和配送中心选择联合决策问题的模糊多目标混合整数规划模型。
Results An multiobjective programing model based on integer programming for ASA problem is established, which serves as the foundation for later researches on optimizing algorithms.
结果建立起了ASA问题的一个多目标整数规划模型，为后续优化算法研究奠定了基础。
The model is formulated as a mixed integer linear programming (MILP) problem.
模型表达为一个混合整数规划(MIL P)问题。
This paper attempts to model capital budgeting problem by chance constrained integer programming with fuzzy decisions.
本文讨论了一类资金预算问题，并建立带有模糊决策的机会约束规划模型的框架。
The problem of bounded nonlinear mixed integer programming is studied.
对一有界约束非线性混合整数规划问题进行了研究。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
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整数规划问题的求解。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
A model for optimizing fault diagnosis for power systems is formulated as a 0-1 integer programming problem. The fault equipment can be determined by means of refined mathematical manipulation.
电网故障诊断优化模型可将诊断问题表示成求极值的0-1整数规划问题，从而可通过严密的数学运算来确知故障设备。
Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented.
该结构优化问题的决策变量采用了向量表示方法，建立0-1整数非线性规划模型，给出了可行解存在性的判定方法。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
应用推荐