本文研究了一类三次系统无穷远点的中心条件与赤道极限环分枝问题。
Studied in this paper are center conditions and bifurcation of limit cycles from the equator for a class of cubic polynomial system.
通过讨论初等多值函数的单值解析分枝问题，重点研究了初等多值函数在复变函数中的具体应用。
The multi-valued problems of elementary complex functions are discussed, and then the applications of general multi-valued functions in complex functions are discussed mainly.
不过问题是它们没法自然繁殖，于是有心人就截取了部分枝条嫁接到其他橙树上，希望生产出更多美味水果。
Since the new tree was unable to reproduce naturally, caretakers amputated some of its limbs and grafted them onto other citrus trees to produce more of the desirable fruit.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
本文首先分析了传统定性推理方法中存在的歧义性分枝和建模手段不强的问题。
In this paper, the problem of ambiguous branches and the weakness of modeling measures existed in the classical qualitative reasoning are analyzed at first.
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios 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.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.
本文研究了资源有限—工期最短的优化问题，提出了相应的分枝定界算法。
In this pater, the problem of limited resources and shortest time limit for a project is studied and an algorithm of branch and bound method for this problem is proposed.
本文利用分枝限界法解决了自愈环光缆路由的选择问题，提出了分层网络光缆路由规划的数学模型。
This paper discusses the problem of choosing optical cable route with branch and bound way and puts forward the model of planning route in Layered network.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
整数规划问题为多维时，理论上可以用分枝定界方法与割平面方法求解。
When the integral program problem is multi dimensional, branch boundary method and cutting plane approach are applicable for solving the problem.
分析表明矩形剪切薄膜的屈曲过程是分枝点平衡问题。
The analysis indicates that the buckling problem of a rectangle membrane is in essence a balance problem of branching points.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。
Based on the general principle of the branch-and-bound method, the branching rule and the bounding calculating method to solve this problem are proposed.
研究积木块布图的二维压缩问题，提出一种采用分枝定界法的真正的二维压缩算法。
The two-dimensional compaction problem of building-block layout is considered in this paper.
本文研究了具有惩罚因子的合同加工排序问题，提出了相应的分枝定界算法。
In this paper, the problem for contract processing sequencing with penalty factor is studied and a branch and bound method for this problem is proposed.
给定了随机环境中分枝过程(BPRE)的精确定义，讨论了有关的可测性问题和BPRE的基本性质。
An exact formulation of the definition of branching processes in random environments (BPRE) is given.
许多分枝非常难预见，虽然预见问题确切地是仍然什么被要求工程师。
Many ramifications are very difficult to foresee, though foreseeing problems is nonetheless exactly what is asked of engineers.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
在该模型的基础上，利用分枝定界算法求解最大割问题。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。
The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed m…
该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。
The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed m…
应用推荐