分枝定界

基于列表的迭代分枝定界MIMO检测算法

List Based Iterative Branch and Bound Algorithm for MIMO Detection

分枝定界MIMO检测算法的推广及改进

An improved branch and bound algorithm in MIMO detection

将分枝定界这种优化搜索算法用在MIMO系统中，并且推广到非二进制高阶调制的情况，在基本算法的基础上提出了对信号排序和候选节点排序的改进算法。

In this paper , the branch and bound method is applied to MIMO detection and generalized to the nonbinary high level modulation constraints .

基于遗传分枝定界算法的Flow-shop调度问题

Flow-shop Optimal Scheduling Problem Based on Genetic Branch and Bound Algorithm

资源约束型Max-npv项目调度问题的分枝定界算法

Resource-constrained Max-npv project scheduling problem and branch and bound algorithm

柔性资源流水线计划（FRFS）的制定。包括问题的规划模型，资源分配的基本原则和分枝定界法；

Scheduling of flexible-resource flow shop , including programming model , resource distribution principle and branch-and-bound algorithm ;

一直以来人们提出了各种算法和程序来加以解决，其中分枝定界（branch-and-bound，BAB）算法是精确算法的重要手段之一，得到国内外学者的广泛重视。

Branch-and-bound ( branch-and-bound , BAB ) algorithm is one of the important accurate algorithms , received great attention from scholars at home and abroad .

基于MVRP的数学规划模型，提出了它的分枝定界算法；

Based on its mathematical programming modeling , the branch and bound algorithm is presented .

自Land和Doig等人提出求解整数规划问题的分枝定界法以来，混合整数规划的求解方法得到了很大的发展。

After Land and Doig put forward the branch and bound algorithm for solving mixed integer programming problem , the research on algorithm that used to solve mixed integer programming problem have made a big progress .

目前在针对可能世界实例的聚合查询（相当于聚类）研究，主要涉及Top-k聚合算法，分别采用分枝定界、计算松弛降低计算复杂性。

At present , instance aggregate queries ( equivalent to clustering ) studies , mainly related to Top-k aggregation algorithm , which used branch and bound , calculation relaxation to reduce computational complexity .

根据线性整数规划的分枝定界算法和二次规划的Lemke算法的原理，给出该模型求解的分枝定界算法，并编写了该算法的Matlab程序。

According to the principle of branch and bound algorithm for linear integer programming and the Lemke algorithm for quadratic programming , this thesis shows a branch and bound algorithm and a program of the algorithm with the Matlab programming language for solving the model .

该策略首先基于动态规划算法和分枝定界算法通过求解包含多个树背包问题（TKP）的孤岛建立和孤岛合并问题而得到初始孤岛组成，然后通过可行性校验和调节得到最终孤岛划分方案。

Initial optimum island partition scheme is gained through island partition procedures including multiple tree knapsack problems ( TKP ) and island combination procedures based on dynamic programming algorithm and branch and bound algorithm . The final island partition scheme is obtained after feasibility checking and adjustment .

带有二次约束二次规划问题的分枝定界方法

A Branch-and-bound Method of the Quadratic Programming Problem with Quadratic Constraints

两层次非线性规划的整体解的分枝定界法

Branch and Bound Method for Global Solution of Nonlinear Bi-leve Programming

求解组合优化问题的一种方法&分枝定界法

An algorithm on solving combinatorial optimization problems & branch-and-bound method

可靠性网络中费用最小化问题的一种新的分枝定界算法

A New Branch-and-Bound Method for Cost Minimization Problems Arising in Reliability Networks

匈牙利算法与分枝定界法解决调色问题之比较

Comparison of Color Solution via Hungarian Algorithm and Branch-and-bound Method

求解最大割问题的分枝定界算法

The branch - and-bound algorithm for max - cut problem

一类带时间约束指派问题的分枝定界算法

A Branch-and-Bound Algorithm for an Assignment Problem with Time Constraints

约束最小权生成树的近似算法和分枝定界算法

Heuristic and exact algorithms for the constraint minimum Wight spanning tree problem

设计了基于分枝定界法的算法来求解该模型。

A branch-and bound method is developed to solve the proposed model .

该算法应用分枝定界法实现局部问题的优化。

Branch and bound strategy is used to optimize the local problem .

多机相关任务的改进型分枝定界调度算法

The improved branch-and-bound schedule algorithm for dependent tasks in multiprocessor

求指派问题多重最优解的分枝定界法

Branch and bound Technique of Finding Alternate Optimal Solutions for Assignment Problem

本文针对有界多面凸集上，双凹函数极小问题，提出一个分枝定界方法。

We propose a branch-and - bound method for solving biconcave function .

混合物定性定量分析的分枝定界算法

A Bound-Branch Algorithm for Qualitative and Quantitative Analyses of Mixtures

公共工期排序问题的分枝定界算法

The Branch and Bound Algorithm for the Common Due Date Scheduling Problem

一类不定二次规划问题的分枝定界法

A branch and bound algorithm for a kind of indefinite quadratic programming

弱有效集上凹函数极大问题的分枝定界算法

A branch and bound algorithm for solving maximizing a concave function over weakly-efficient

几何规划问题的一种分枝定界方法

A Branch - and-Bound Method of Geometric Programming Problems