branch and bound algorithm 中文意思是什麼

branch and bound algorithm 解釋
分枝界定法
  • branch : n 1 （樹）枝〈泛指大枝或小枝；bough 特指大枝，也指連花、果折下的枝；limb 指大枝；twig 指小枝〉。2...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. The branch - and - bound algorithm for max - cut problem

    求解最大割問題的分枝定界演算法
  2. Abstract : a cad tool based on a group of efficient algorithms to verify, design, and optimize power / ground networks for standard cell model is presented. nonlinear programming techniques, branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method ( iccg ) are the three main parts of our work. users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed. the experimental results prove that the algorithms can run very fast with lower wiring resources consumption. as a result, the cad tool based on these algorithms is able to cope with large - scale circuits

    文摘:介紹了一個基於標準單元布圖模式的電源線/地線網路的輔助設計集成工具.它應用了一系列高效的演算法，為用戶提供了電源線/地線網路的設計、優化和驗證的功能.非線性優化技術、分枝定界演算法和不完全喬萊斯基分解的預優共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結果表明，文中所提供的演算法可以在很快的運行速度下實現更低的布線資源佔用.因此，在這些有效演算法基礎上實現的輔助設計工具具有處理大規模電路的能力
  3. A great significance of this article is that it changes the branch and bound algorithm and backtracking algorithm into application examples of the generic search algorithm of optimal problems advanced in this article

    本文的一個重要意義是將回溯法和分支限界法這兩個傳統的演算法策略轉變為本文所提出的通用搜索演算法的應用例子。
  4. As an application of succeeding, a numerical example of max - cut is given. 3. several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated. rounding, coordinate descent, cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution

    本文紿出了基於半定規劃模型尋求多用戶檢測問題次優解的幾種重要方法，包括隨機擾動法、坐標下降法、半定規劃的割平面法和二次規劃的分枝定界法等
  5. Based on our extensive study of many different scheduling optimizations, we can summarize the results into five scheduling rules. based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model

    根據不同生產方式優化調度研究成果得出了五個調度規則，應用這些規則與分枝定界方法分別構造出上、下層調度模型的啟發式分枝定界優化演算法。
  6. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  7. So a lot of researchers have attached importance to optimization computing, and put forward all kinds of algotithms for optimization problems, for instance : simplex algorithm, dynamic programming algorithm, branch - bound algorithm, etc. but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems

    為了解決各種優化計算問題，人們提出了各種各樣的優化計算方法，如單純形法、梯度法、動態規劃法、分枝剪界法。這些優化演算法各有各的長處，各有各的適用范圍，也有各自的限制。
  8. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm

    近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。
  9. This paper consists of two parts. in the first part, a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed

    本文分兩部分，第一部分研究求解邊界約束非凸二次規劃問題的整體最優解的分支定界演算法。
  10. Branch and bound algorithm

    分枝界定法
  11. In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency

    本文設計實現的一種專用於計算分支定界演算法的機群計算平臺，能減少分支定界演算法的計算時間復雜度，提高分支定界演算法的效率。
  12. A new branch and bound algorithm for solving complex integer quadratic programs

    解復雜二次整數規劃問題的新型分枝定界演算法
  13. A branch and bound algorithm for solving maximizing a concave function over weakly - efficient

    弱有效集上凹函數極大問題的分枝定界演算法
  14. Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems

    分支定界演算法是求解優化問題的重要方法。
  15. 4. the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon

    計算表明，在保證求得最優解的前提下，該平臺能很好地提高分支定界演算法的效率。
  16. 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

    計算表明，在保證求得最優解的前提下，該平臺能很好地提高分支定界演算法的效率。
  17. We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study

    根據johnson演算法和并行可替換機床優化調度演算法，構造了兩種可行的啟發式優化調度演算法，並通過數值計算，驗證了演算法的有效性。
  18. The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper. based on these existing algorithms, we present a new branch and bound algorithm for the maximum weight clique problem

    本文首先對當前國際上最大團問題的理論研究成果及演算法研究中的啟發式演算法進行了介紹，然後對精確演算法中的分支定界法作了較為詳細的討論，最後作者在現有演算法的基礎上，給出了最大加權團問題的一種新的分支定界演算法。
分享友人
分享到 Line

分享到臉書