optimum tree 中文意思是什麼
optimum tree
解釋
最佳樹形-
Therefore, 0 - 1 - programming model shall be established respectively for the two optimizing targets, and uses the method of sorted combined tree to get optimum result
為此對兩個優化目標分別建立0 - 1規劃模型，並利用有序組合樹法求解出最優解。 -
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
該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。 -
To make it clear, the article use and analyze numerical value cases from bellmum and zadeh. finally in order to work out the value function in all forms and the expected value of optimization in all aspects easily, we take down all the problem existing in multi - stage stochastic decision processes. the solution of optimum is formed and multi - stage stochastic decision tree - table is introduced
為說明問題，本文利用bellman和zadeh [ 1 ]的數值例，應用兩種方法進行分析，最後為了更方便的解出對所有形式的評價函數，及其期望值的最優化解對各種進行的發展，把經過多階段概率決策過程的問題記述下來，構成一個最優解的統一圖表，引入了多段概率決策樹表。
分享友人