Multiobjective Problem Reduction Search
Pallab Dasgupta, P. P. Chakrabarti, S.C. DeSarkar · 1999
Problem reduction search is a popular scheme for solving problems that can be hierarchically broken down to a conjunction or disjunction of subproblems [69]. Since such problems can be conveniently represented by AND/OR graphs, problem reduction search is often considered to be synonymous with the problem of searching AND/OR graphs. The algorithm AO* is the most well studied strategy for this representation [11, 41, 62, 63, 68, 69].