branching algorithm 中文意思是什麼
branching algorithm
解釋
分支演算法-
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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。 -
The information of skeleton is also used to deal with branching problem. experiments show that the proposed algorithm can retrieve cases with complex contours. the technique of surface reconstruction using distance field is explored in chapter 4
對于離散距離場的計算，我們提出用輪廓線擴散的方法來進行加速，和最小歐幾里得距離方法比較，該方法具有速度快的優點，其時間復雜度為o加。 -
The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds, and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex, and uses backtracking method to obtain optimum solution
該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。 -
These kinds of ? tronger ? algorithms do not need to retrieve correspondence and branching problems. the contour - spreading algorithm is proposed to calculate distance field quickly within the complexity 0 ( n ). the intermediate surface is generated by linear approximation, while in conventional methods, it is tiled between a designated layer of contours and the original lower slice or upper slice of contours
和傳統方法比較，它們生成的曲面都是精確通過采樣點，但是對于中間曲面的生成（在有分枝問題和對應問題時）方式不同，傳統方式是指定中間層的位置，在中間層按一定方式生成一個輪廓線，然後分別與上下層進行曲面鑲嵌，而基於距離場技術的方法則是通過線性插值的方式來產生中間曲面。
分享友人