integer programming problem的例句大全

A reliability optimization problem of multilevel serial systems and bridge network systems, with the constraints of cost, volume and weight, is a nonlinear mixed integer programming problem, which has a large number of local extreme values.

研究在造价、体积和重量约束条件下，多级串联系统和桥式网络系统可靠性优化问题。

Thus, chaotic searching algorithm is generalized to solving a kind of 0-1 integer programming problem. Chaotic searching algorithm is applied to optimize effectiveness in absence of air defenses.

然后利用M个独立的混沌变量在这NM个等分区域中搜索最优解，从而将混沌搜索算法推广应用于解决一类0-1整数规划问题。

This paper formulates the satellite imaging scheduling problem as a0-1 integer programming model, which is NP complete.

建立了卫星成像调度问题的0-1整数规划模型，该问题具有NP完全特性。

We develops the static model of overline passenger link problem at Dedicated passenger line hub which inherit 0-1 integer programming and also the arithmetic.

论文建立了基于0-1规划的客运专线枢纽旅客衔接方案静态优化模型，并分析了其求解算法。

This paper attempts to model capital budgeting problem by chance constrained integer programming with fuzzy decisions.

本文讨论了一类资金预算问题，并建立带有模糊决策的机会约束规划模型的框架。

Based on the research of the internal features of maintenance scheduling problem, this paper establishes its integer programming based optimization module and algorithm.

本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。

This paper presents a nonlinear 0 1 integer programming model for the combined local and through freight train routing/ makeup problem from the viewpoint of network flows and combinatorial optimization.

从网络流与组合优化的观点研究直达与区段列车编组计划、车流运行径路的整体优化问题，并建立了该问题的非线性0－1整数规划模型。

all decision models are formulated as an integer multiple problem and is solved using a mathematical programming solver.

所有模式均为一整数规划问题，本研究配合CPLEX数学规划软体求解模式。

the model belongs to mixed 0-1 integer programming model and is np problem, the more difficult to solve directly.

该模型为混合0-1整数规划模型，属于NP问题，直接求解较困难。

then this paper studies two main kinds of layout problem: quadratic assignment problem and mixed integer programming.

在此思路基础上，分别对两类设备布局问题——二次分配问题和混合整数规划问题建立数学模型。

the combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways.

用穷举法和隐枚举法解0-1型整数规划问题时，常常遇到组合爆炸问题。

to resolve the multiple cooperative ucav mission assigning problem, a multi-object integer programming model is presented, and a hybrid genetic algorithm is proposed. the constraints are sorted into global ones and partial ones.

针对多UCAV协同作战任务分配问题，建立了多目标整数规划模型，提出了基于整数编码的混合遗传算法。

An integer programming model including a computation rule for the joint decision problem is proposed with the objective of minimizing the total tardiness penalty cost.

研究了单元构建和调度的联合决策问题，以最小化单元制造系统的总拖期费用为目标，建立了嵌入计算规则的整数规划模型。

In this paper, we analyzed some property for the single restrict integer linear programming ( Knapsack problem), Cut the invalided variable and simplify the problem. Designed a new algorithm& reduce dimension and Recursive algorithm.

本文对单约束线性整数规划（ILP，背包问题）的特性进行了分析，通过剪去无效变量对问题进行简化并设计了问题的一种新算法&降维递归算法，全文共分四章。