|
Subject: depth first strategy math. Пожалуйста, помогите перевести.depth first strategy Выражение встречается в следующем контексте: We now have all prerequisites to formulate the algorithm. The algorithm pursues a depth first strategy. That is, movement down a branch of the search tree, and therefore having more variables fixed in B1 or B0, is preferred to investigating partial solutions with fewer fixed variables. Successors of a node in a tree (branching) are distinguished by different sizes of B1 and B0. Actually, the tree can be drawn so that the sets B1 of successors of a node will be become smaller, as variables are moved from B1 to B0, see Figure 10.1. The idea is that by fixing many variables first according to their value to weight ratios, a good feasible solution is obtained fast, so that many branches of the tree can be fathomed early. Заранее спасибо |
|
стратегия (первоначального) поиска в глубину т.е. сначала поиск ведется по выбранной ветке в глубину до получения оптимума |
| You need to be logged in to post in the forum |