您要查找的是不是：
- And a comparison between the standard BAB (branch and bound) &the proposed two level GA approach was given. 對典型算例進(jìn)行了仿真，并與分枝定界法的求解結果進(jìn)行了比較。
- Who explained some algorithm, dynamic programming, backtracking, branch and bound and so on. 講解一些算法的研究，動(dòng)態(tài)規劃，回溯，分支限界等。
- A general subset selection method, the branch and bound technique, is applied to a control structure selection problem. 一種通用的子集合選擇方法一分支定界法被應用于控制結構選擇問(wèn)題。
- One is tradition algorithm,which consists branch and bound method,improving loop method,cupidity algorithm,MST algorithm,MM algorithm,insertion method. 第一種為傳統算法,包括分支定界法、改良回路法、貪婪算法、MST算法、MM算法、插入法等;
- A branch and bound (B&B) algorithm for solving MRC-DTCTP model is developed and applied to computing the deadline for the project. 為每個(gè)項目活動(dòng)引入壓縮執行方式以縮短項目工期。最后提出一種求解該模型的分支定界算法。
- This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem. 針對一類(lèi)非線(xiàn)性比式和問(wèn)題首次提出一種求其全局最優(yōu)解的單純形分枝定界算法。
- The minirpum singular value is used as the criterion for the branch and bound method.The monotonicity of the minimum singular value is explained. 用最小奇異值作為控制結構選擇的評價(jià)函數并對其單調性條件作了說(shuō)明。
- Using some numerical examples, we compare the performance of the proposed algorithms with an optimum algorithm, namely the branch and bound algorithm. 我們使用了一些數學(xué)范例，并應用一種稱(chēng)為分支界限化的最佳化演算法來(lái)比較所發(fā)展的演算法之效率。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 對于二層規劃問(wèn)題有許多經(jīng)典的求解方法,如極點(diǎn)搜索法、分支定界法和罰函數法等。
- Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance. 分枝限界算法是一種求解組合優(yōu)化問(wèn)題的一般性方法，并行化是提高算法性能的有效手段。
- To deal with such an NP-hard problem, the paper proposes two dynamic programming algorithms, a branch and bound algorithm with a polynomial solvable case. 對于這一NP-困難的排序問(wèn)題，本文給出了兩個(gè)動(dòng)態(tài)規劃解法及其多項式可解的特例，并給出了一個(gè)分枝定界算法。
- The results show that in comparison with the branch and bound algorithm, the proposed metaheuristics can obtain better objective function values in less computational time. 結果顯示，與分支界限法相比較，所發(fā)展出來(lái)的通用啟發(fā)式演算法可以使用較少的計算時(shí)間，并得到不錯的目標函數值。
- Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work. 非線(xiàn)性?xún)?yōu)化技術(shù)、分枝定界算法和不完全喬萊斯基分解的預優(yōu)共軛梯度法是該工作的三個(gè)主體部分.
- The solving TSP( Traveling Salesman Problem) examples as benchmark shows that this platform can increase the branch and bound algorithm's efficiency and get the optimal solution sooner. 計算表明，在保證求得最優(yōu)解的前提下，該平臺能很好地提高分支定界算法的效率。
- Based on 0-1 integer linear programming,mathematics model is set and solved by linprog function in optimistic toolbox of MATLAB 6.5.The solution only containing zeros and ones is acquired using branch and bound algorithm. 在0-1整數規劃的基礎上建立了數學(xué)模型;利用MATLAB 6.;5優(yōu)化工具箱中的linprog函數進(jìn)行求解;再經(jīng)過(guò)分支定界算法計算;求出了只含有0和1的解
- An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem. 本文提出了一種求最小約簡(jiǎn)的基于命題可滿(mǎn)足性(簡(jiǎn)稱(chēng)SAT)的算法,提出一個(gè)解決SAT問(wèn)題的分割和結合的算法。
- Abstract： Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance. 摘 要： 分枝限界算法是一種求解組合優(yōu)化問(wèn)題的一般性方法，并行化是提高算法性能的有效手段。
- Based on branch and bound technique and proposed pruning, updating and visiting heuristics, recursive depth-first and heap-based best-first query processing algorithms are developed for both cases. 采用分支界定技術(shù)和給出的啟發(fā)式規則，設計了迭代的深度優(yōu)先和基于堆的最好優(yōu)先的查詢(xún)處理算法。
- One of the books of a work printed and bound in more than one book. 冊印刷并裝訂在一起的不止一本的作品中的一本
- A smell of burnt branches and leaves penetrated the woods. 森林中彌漫著(zhù)樹(shù)枝和樹(shù)葉燒焦的氣味。
