branch bound method 中文意思是什麼

branch bound method 解釋
分支估界法
  • branch : n 1 （樹）枝〈泛指大枝或小枝；bough 特指大枝，也指連花、果折下的枝；limb 指大枝；twig 指小枝〉。2...
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • method : n 1 方法，方式；順序。2 （思想、言談上的）條理，規律，秩序。3 【生物學】分類法。4 〈M 〉【戲劇】...
  1. 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

    文摘:介紹了一個基於標準單元布圖模式的電源線/地線網路的輔助設計集成工具.它應用了一系列高效的演算法，為用戶提供了電源線/地線網路的設計、優化和驗證的功能.非線性優化技術、分枝定界演算法和不完全喬萊斯基分解的預優共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結果表明，文中所提供的演算法可以在很快的運行速度下實現更低的布線資源佔用.因此，在這些有效演算法基礎上實現的輔助設計工具具有處理大規模電路的能力
  2. 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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  3. 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

    近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。
  4. For spatial, ideal elasto - plastic girder - pane structure system, using the stochastic finite element method, the static response of structural system is analyzed. taking redistribution of internal forces into account, safety margin functions of failure modes are established. using the advanced branch - and - bound method, the significant failure modes are identified, and the reliability of structural system is evaluated by pnet method

    對空間理想彈塑性梁板體系結構，採用隨機有限元計算結構系統的響應量；考慮內力重新分配，建立失效模式的安全余量方程，用驗算點法計算失效模式安全余量的可靠性指標；用改進的分枝限界法，尋找主要失效模式：然後用pnet法計算結構系統的可靠性指標（或失效概率） 。
  5. Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems

    分支定界演算法是求解優化問題的重要方法。
  6. When problem scale is small, we can adopt many classical algorithms such as linear programming integer programming, branch and bound method to solve this problem

    當問題規模較小時，可用線性規劃、整數規劃、動態規劃等經典演算法求解。
  7. Branch - bound method

    分支界限法
分享友人
分享到 Line

分享到臉書