PROBLEM TO BE SOLVED: To decrease a computational complexity associated with a search for an optimum solution.;SOLUTION: The problem to be solved is solved by a search processing optimization program that allows a computer to the processes of: comparing weight coefficients of bifurcations from respective nodes for a plurality of branch weighted binary decision graphs; subtracting a value of a branch having a small weight coefficient from a weight coefficient of each branch of a bifurcation so that a branch having a small weight coefficient has a constant value; performing normalization in which the value of the branch having the small weight coefficient is added to a branch of a node of a layer right above; performing additive decomposition on the plurality of branch weighted binary decision graphs having been normalized; and simultaneously searching the plurality of binary decision graphs obtained through the additive decomposition to find an optimum solution.;SELECTED DRAWING: Figure 12;COPYRIGHT: (C)2018,JPO&INPIT
展开▼