0-1

0-1规划问题的DNA计算算法研究

Research on DNA Algorithm of 0-1 Programming Problem

0-1整数规划问题的半自动化DNA计算模型

Semi - roboticized DNA computing model of the 0 - 1 integer programming problem

基于Matlab的0-1背包问题的动态规划方法求解

DP Algorithm of Solving 0-1 's Knapsack Problem Based on Matlab

解0-1背包问题的混合编码贪婪DE算法

Mixed Coding Greedy Differential Evolution Algorithm for 0-1 Knapsack Problem

通过筛选得到两株性能优良的乳酸菌，分别为B（0-1）和B（1-1）。

Two good strains & B_ ( 0-1 ) and B_ ( 1-1 ) have been selected from some lactic acid bacteria .

AC米兰输掉了又一场热身赛，这次的对手是曼城（0-1）。

AC Milan have lost another friendly game , this time against Manchester City ( 0-1 ) .

所改进的0-1算法与传统的March算法相比，明显降低了测试开销。

Compared to the March algorithm , the improved 0-1 Algorithm obviously reduces the test cost .

本文结合生物学的研究方法和实验技术，对DNA计算及其模型生物实现过程中的编码问题做了初步地探讨，并就DNA计算中的简单0-1规划问题和排课表问题进行了初步研究。

With the biological research method and experimental technique , the encoding problem and DNA computing model were mainly studied in this doctoral thesis .

文中还给出了利用表面载体计算模型、DNA芯片模型等解决0-1整数规划。

In this paper , we supplied DNA surface-based computing model and DNA chip model and other models to soved 0-1 integer programming problem .

0-1背包问题和背包问题是一类经典的NP困难问题。

0-1 knapsack problems and knapsack problems are a classical NP hard problems .

曝光时间和CR摄影得分为目标的0-1整数规划模型，用分组过滤方法简化解空间，最后用遗传算法求解。

Grouped filtering method was used to simplify the solution space , then the optimized model is solved by genetic algorithm .

该模型属于混合0-1的模糊非线性规划模型，且具有NP难性质。

The model is in fact a mixed 0-1 non-linear fuzzy programming model with NP-hard complexity .

基于高维0-1变量的EM算法在移动通信客户细分中的应用

The EM Algorithm Based on High Dimensional Binary Response and Its Application in Market Segmentation of China Mobile

解0-1线性规划Surrogate对偶的一个方法

A method for solving surrogate dual in zero-one linear programming

从模型的形式上看，该模型属于运筹学领域中的非线性0-1整数规划问题，在理论界属于NP-Hard问题，求解起来很困难。

The model is formulated as a non-linear integer-programming problem .

该方法的主要思路是将QoS驱动的复合服务问题建模为0-1整数线性规划模型，并运用整数规划算法求解复合服务选择问题。

This approach models the QoS-driven service selection problem as 0-1 Integer Linear Programming , and then solves the problem through programming algorithm .

基于0-1分布的公路机动车起讫点（OD）调查抽样

Sampling of motor vehicle 's origin-destination ( OD ) survey along highway based on 0-1 distribution

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

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

基于0-1整数线性规划的运动项目排序问题及LINGO软件实现

Sport items sort based on 0-1 integer planning and LINGO simulation

其次，在现有DVD数量的基础上，建立了求解DVD分配情况的整数规划（0-1规划）模型，给出了具体的分配方案。

Integer programming ( 0-1 programming ) model are established , the concrete assignment scheme of DVD is provided .

第五章建立了基于0-1规划的存量与增量全部组合贷款优化决策模型。第六章建立了基于VaR约束的多目标组合贷款优化决策模型。

In the fifth chapter , we build a decision optimization model for accumulate and increment loan portfolio on base of 0-1 regulation .

本文中的核心技术思想是以运筹学理论与方法为基础而构建的，在系统设计的过程中大量的运用了0-1规划，ColumnGeneration（按列归纳模型）等具体问题解决方法。

The core content of the article is base on the conception and methods of the theory of operation research , such like zero-one planning , column generation and some other direct solutions .

随后，本文提出了基于0-1线性整数规划的能灵活满足多种约束条件的通用PMU配置方法。

And then a flexible optimal PMU placement algorithm based on 0-1 linear integer problem is proposed .

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

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 .

在著名的多目标优化遗传算法NSGA-II中，引入邻域搜索机制，并将其应用于多目标0-1背包问题的求解。

In the famous algorithm NSGA-II , the neighborhood search is introduced .

多目标0-1背包问题是一个NP-complete的多目标优化问题，基于群体搜索机制的遗传算法非常适合多目标优化问题的求解。

Multi-objective 0-1 knapsack problem is an NP-complete multi-objective optimization problem . Population-based genetic algorithm is well-suited for multi-objective optimization problems .

针对数字系统高层设计的特点，本文提出了基于CDM模型的0-1规划软硬件划分方法。

In view of the characteristic of high-level design , the HW / SW partitioning method using 0-1 algorithm based on CDM model is presented .

多维0-1背包问题同时还是一个典型的NPC问题，对背包问题的研究无论在实际应用还是在理论研究中都有着重要意义。

Multi-dimensional 0-1 knapsack problem is also one of a class ' of typical NPC problem . It has important meanings in practice and in theory to study it .

针对以上问题，论文对LINGO语言与0-1混合整数规划选址模型进行再结合。

To solve the above problems , this paper on the LINGO language and0-1 mixed integer programming model for re-location combination .

引进遍历性条件，利用分析方法研究了随机环境中独立随机过程，重点讨论马氏环境中的0-1分布、Poisson分布和一般离散分布。

Several ergodicity conditions are introduced , and the independent process in random environments is investigated by analytical method , especially the 0-1 distribution , Poisson distribution and general discrete distribution .