branch and bound technique 中文意思是什麼

branch and bound technique 解釋
分支界限技術
  • branch : n 1 （樹）枝〈泛指大枝或小枝；bough 特指大枝，也指連花、果折下的枝；limb 指大枝；twig 指小枝〉。2...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • technique : n. 1. （專門）技術；（藝術上的）技巧，技能。2. 手法〈如畫法，演奏法等〉。3. 方法。
  1. 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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  2. To improve the efficiency of the branch and bound technique, some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability

    同時，為提高分支定界法的效率，利用啟發式規則剪去產生最優解可能性很小的分支。
  3. In addition, in consideration of the non - convex and non - concave nature of the combinational optimization sub - problem, the branch and bound technique is adopted to obtain or approximate the global optimal solution

    針對組合優化子問題的非凸非凹性，採用分支定界法，以求得或接近全局最優解。
分享友人
分享到 Line

分享到臉書