其中最重要的是纯整数线性规划问题。
One of the most important thing is a pure integer linear programming problem.
然而，在混合整数线性规划的框架下，模型的扩展十分困难。
However, it is quite difficult for the expansion of model under the MILP framework.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
The master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
第四章详述了利用纯整数线性规划的方法建立海运渡箱系统的优化模型；
Forth chapter: put forward innovating model: empty container reposition optimization model with Pure integer Linear Programming(PILP).
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
以水源-水阱匹配关系为约束条件，建立了单杂质用水网络的混合整数线性规划模型。
The mixed integer linear programming model was established with the water source-sink matching as the constraint.
建立了面向供应链的多产品、多订单、多时段的订单任务分配的混合整数线性规划模型。
A mixed integer linear programming (MILP) model for orders dispatching in a supply chain with multi-product, multi-order, and multi-period was proposed.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
为了提高求解一般整数线性规划问题的效率，提出了一种基于目标函数超平面移动的分支算法。
In order to improve the computational efficiency, a branch algorithm for general integer linear programming problems on the objective function hyperplane shifts was presented.
研究了员工具有异质效率、最小化项目工期的项目调度问题，并建立了相应的整数线性规划模型。
Project scheduling with heterogeneous efficiency workforce to minimize project duration is considered, and the corresponding integer linear programming is presented.
针对编队卫星队形重构的轨迹规划问题，提出了直接配置混合整数线性规划(DCMILP)方法。
This article presents a direct collocation mixed integer linear programming (DCMILP) method for energy-optimal trajectory planning of satellite formation reconfiguration.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
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.
运用整数线性规划方法，结合焊管生产线的实际，提出了焊管配尺优化锯切的方法，并编制了相应的软件。
In this paper, integer linear programming is applied for improving pipe production line. A new method of cutting optimization and the relevant software are present.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
本文首先深入分析多无人机任务分配问题的特点，建立了扩展的混合整数线性规划(MILP)任务分配模型。
Firstly, the features of UAV task assignment are analyzed in depth, and then the extended mixed integer linear programming (MILP) model for task assignment is established.
针对传统的线性测量网络设计中没有给出具体的整数线性规划(ILP)模型问题，提出一种传感器优化配置模型。
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.
该模型基于混合整数线性规划模型，以供应网络内总生产成本和物流成本最小化作为目标函数，并应用标准优化软件求解。
Minimizing total production and logistic costs within the supply network was considered as the objective function. This modified model can be solved using standard optimization software.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
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.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
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.
应用推荐